IP Library Granted Patent US 12,511,585
Granted Patent B2
US 12,511,585 · App. 18/465,917 · Granted Dec 30, 2025

System and method of selecting a relevant user for introduction to a user in an online environment

Inventor: Johann M. Schleier-Smith (San Francisco, CA)
Assignee: Ifwe, Inc.
G06Q10/00G06F3/0482G06F3/04842G06F16/9535G06Q30/02G06Q50/01H04L65/403H04W4/021H04W4/21
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,511,585
App. No.
18/465,917
Granted
Dec 30, 2025
Kind
B2
Abstract

Systems and methods of selecting a relevant user for introduction to a user in an online environment are disclosed. In one aspect, embodiments of the present disclosure include a method, which may be implemented on a system, of receiving a request to identify the relevant user to be introduced to the participating user in the social network, identifying a set of social history records that occurred among the multiple users in the social network, selecting, from the multiple users, the relevant user to be introduced to the participating user using the set of social history records. The relevant user that is selected is not a social connection of the participating user in the social network. One embodiment includes, determining whether the participating user is interested in meeting the relevant user in the social network based on an indication made by the participating user via interaction with the user device.

Claims (53)

1 . A method for selecting relevant users to present to a participating user in a social network in an online environment, the method comprising:

identifying, by a server, a set of nodes within the online environment having edges therebetween indicating interactions between multiple nodes that occurred in the online environment;

assigning, by the server, weighting factors to each of the edges among the multiple nodes based on a type of interaction indicated by the corresponding edges;

storing, by the server, a timestamp associated with occurrence of each interaction;

adjusting, by the server, the weighting factors based on an elapsed time from a time of occurrence of each interaction indicated by the timestamp associated with each interaction;

identifying, by the server, a set of nodes among the multiple nodes based on a relevancy score of each of the multiple nodes, wherein the relevancy score is based on the edges and the weighting factors assigned to the edges; and

presenting, by the server, node data of the set of nodes to the participating user via a webpage based on the relevancy score associated with the set of nodes, the webpage including links to initiate further interaction with the set of nodes in an order based on the relevancy score.

2 . The method of claim 1 , wherein the relevancy score is further determined using a last log on time or a log on frequency.

3 . The method of claim 1 , wherein the relevancy score is further determined using a frequency counter indicative of a number of interactions associated with the edges.

4 . The method of claim 1 , further comprising:

selecting a predetermined number of selected users from the set of nodes, wherein the predetermined number of selected users are presented to the participating user in a randomized order.

5 . The method of claim 1 , further comprising:

determining, by the server, whether the participating user is interested in a selected user based on an indication made by the participating user via interaction with a user device; and

in response to determining that the participating user has indicated interest in the selected user, sending, by the server, a notification of interest to the selected user.

6 . The method of claim 1 , wherein the edges includes a set of social interactions among the multiple nodes in the online environment.

7 . The method of claim 6 , wherein the set of social interactions includes sending and receiving of a message.

8 . The method of claim 6 , wherein the set of social interactions includes responding to and sending a notification of interest.

9 . The method of claim 6 , wherein the set of social interactions includes a friendship connection among at least some of the set of nodes in the online environment.

10 . The method of claim 6 , wherein the set of social interactions includes viewing a profile, posting a comment, and sending an invitation.

11 . The method of claim 1 , wherein the assigning weighting factors includes:

assigning a higher weighting factor to edges of a first type of interaction than to edges of a second type of interaction.

12 . The method of claim 1 , wherein the assigning weighting factors includes:

assigning a higher weighting factor to edges of a first type of interaction that occurred more recently than another edge of the first type that occurred less recently.

13 . The method of claim 1 , wherein the assigning weighting factors includes:

assigning a higher weighting factor to a first edge that occurred between the participating user and a first node of the multiple nodes than a second edge that occurred between the participating user and a second node of the multiple nodes, wherein the first edge occurred after the second edge.

14 . A system for identifying a relevant user to present to a participating user in a social network in an online environment, the system comprising:

a processor; and

a memory storing instructions, which when executed, perform a method of:

identify, by a server, a set of nodes within the online environment having edges therebetween indicating interactions between multiple nodes that occurred in the online environment;

assign, by the server, weighting factors to each of the edges among the multiple nodes based on a type of interaction indicated by the corresponding edges;

store, by the server, a timestamp associated with occurrence of each interaction;

adjust, by the server, the weighting factors based on an elapsed time from a time of occurrence of each interaction indicated by the timestamp associated with each interaction;

identify, by the server, a set of nodes among the multiple nodes based on a relevancy score of each of the multiple nodes, wherein the relevancy score is based on the edges and the weighting factors assigned to the edges; and

present, by the server, node data of the set of nodes to the participating user via a webpage based on the relevancy score associated with the set of nodes, the webpage including links to initiate further interaction with the set of nodes in an order based on the relevancy score.

15 . The system of claim 14 , wherein the processor is further configured to:

determine whether the participating user is interested in a selected node based on an indication made by the participating user via interaction with a user device; and

in response to determining that the participating user has indicated interest in the selected node, send a notification of interest to the selected node.

16 . The system of claim 14 , wherein the processor is further configured to:

present node data of interested users who have indicated interest in the participating user among the user data of the set of nodes.

17 . A non-transitory computer-readable storage medium storing computer readable instructions for identifying a relevant user to present to a participating user in a social network in an online environment, comprising:

instructions for identifying, by a server, a set of nodes within the online environment having edges therebetween indicating interactions between multiple nodes that occurred in the online environment;

instructions for assigning, by the server, weighting factors to each of the edges among the multiple nodes based on a type of interaction indicated by the corresponding edges;

instructions for storing, by the server, a timestamp associated with occurrence of each interaction;

instructions for adjusting, by the server, the weighting factors based on an elapsed time from a time of occurrence of each interaction indicated by the timestamp associated with each interaction;

instructions for identifying, by the server, a set of nodes among the multiple nodes based on a relevancy score of each of the multiple nodes, wherein the relevancy score is based on the edges and the weighting factors assigned to the edges; and

instructions for presenting, by the server, node data of the set of nodes to the participating user via a webpage based on the relevancy score associated with the set of nodes, the webpage including links to initiate further interaction with the set of nodes in an order based on the relevancy score.

18 . The non-transitory computer-readable storage medium of claim 17 further comprising:

instructions for determining whether the participating user is interested in a selected node based on an indication made by the participating user via interaction with a user device; and

instructions for, in response to determining that the participating user has indicated interest in the selected node, sending, by the server, a notification of interest to the selected node.

19 . The non-transitory computer-readable storage medium of claim 17 , wherein the instructions for assigning weighting factors include:

assigning a higher weighting factor to edges of a first type of interaction than to edges of a second type of interaction.

20 . The non-transitory computer-readable storage medium of claim 17 , wherein the instructions for assigning weighting factors include:

instructions for assigning a higher weighting factor to edges of a first type of interaction that occurred more recently than another edge of the first type that occurred less recently.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 16, 2023
From: SCHLEIER-SMITH, JOHANN M.
To: TAGGED, INC.
Reel/Frame 065591/0325 →
CHANGE OF NAME Recorded Nov 16, 2023
From: TAGGED, INC.
To: IFWE INC.
Reel/Frame 065611/0330 →
Continuity (5)
Continuation 17341197 · Jun 7, 2021
Continuation 14278616 · May 15, 2014
Division 13109931 · May 17, 2011
Division 12407746 · Mar 19, 2009
Related Publication 20240070556A1 · Feb 29, 2024
References Cited (120)
US 5925100A · Drewry et al. · 1999 [cited by applicant]
US 6085226A · Horvitz · 2000 [cited by applicant]
US 6112181A · Shear et al. · 2000 [cited by applicant]
US 6149441A · Pellegrino et al. · 2000 [cited by applicant]
US 6285999B1 · Page · 2001 [cited by applicant]
US 6306033B1 · Niwa et al. · 2001 [cited by applicant]
US 6381635B1 · Hoyer et al. · 2002 [cited by applicant]
US 6385641B1 · Jiang et al. · 2002 [cited by applicant]
US 6963874B2 · Kasriel et al. · 2005 [cited by applicant]
US 7069308B2 · Abrams · 2006 [cited by examiner]
US 7117254B2 · Lunt et al. · 2006 [cited by applicant]
US 7149977B2 · Zaner et al. · 2006 [cited by applicant]
US 7222186B2 · Kobayashi · 2007 [cited by applicant]
US 7234117B2 · Zaner et al. · 2007 [cited by applicant]
US 7249123B2 · Elder et al. · 2007 [cited by applicant]
US 7269590B2 · Hull et al. · 2007 [cited by applicant]
US 7359894B1 · Liebman et al. · 2008 [cited by applicant]
US 7366759B2 · Trevithick et al. · 2008 [cited by applicant]
US 7373606B2 · Gorzela · 2008 [cited by applicant]
US 7433876B2 · Spivack et al. · 2008 [cited by applicant]
US 7529797B2 · Tseng et al. · 2009 [cited by applicant]
US 7756926B2 · Tseng et al. · 2010 [cited by applicant]
US 7761385B2 · Hutchison et al. · 2010 [cited by applicant]
US 7761386B2 · Teicher · 2010 [cited by applicant]
US 7769699B2 · Teicher · 2010 [cited by applicant]
US 7818394B1 · Lawler et al. · 2010 [cited by applicant]
US 7831684B1 · Lawler et al. · 2010 [cited by applicant]
US 7844671B1 · Lawler et al. · 2010 [cited by applicant]
US 7917448B2 · Smola et al. · 2011 [cited by applicant]
US 7945862B2 · Aldrich et al. · 2011 [cited by applicant]
US 7974868B2 · Tseng et al. · 2011 [cited by applicant]
US 7991401B2 · Linder et al. · 2011 [cited by applicant]
US 8060462B2 · Flinn · 2011 [cited by examiner]
US 8069142B2 · Davis et al. · 2011 [cited by applicant]
US 8095551B2 · Kountz et al. · 2012 [cited by applicant]
US 8136089B2 · Snodgrass et al. · 2012 [cited by applicant]
US 8166407B2 · Lee et al. · 2012 [cited by applicant]
US 8239499B2 · Kwon · 2012 [cited by examiner]
US 8566788B2 · Snodgrass et al. · 2013 [cited by applicant]
US 8620935B2 · Rubin · 2013 [cited by examiner]
US 8661002B2 · Smith · 2014 [cited by examiner]
US 8682971B2 · Farrell · 2014 [cited by examiner]
US RE44905E · Tseng et al. · 2014 [cited by applicant]
US 8756163B2 · Schleier-Smith · 2014 [cited by applicant]
US 8756304B2 · Leacock · 2014 [cited by examiner]
US 9584343B2 · Brezina · 2017 [cited by examiner]
US 9619846B2 · Rekhi · 2017 [cited by examiner]
US 11487769B2 · Rubinstein · 2022 [cited by examiner]
US 20010020231A1 · Perri et al. · 2001 [cited by applicant]
US 20020042733A1 · Lesandrini et al. · 2002 [cited by applicant]
US 20020103698A1 · Cantrell · 2002 [cited by applicant]
US 20030115333A1 · Cohen et al. · 2003 [cited by applicant]
US 20030200282A1 · Arnold et al. · 2003 [cited by applicant]
US 20030208578A1 · Taraborelli et al. · 2003 [cited by applicant]
US 20040003038A1 · Huang et al. · 2004 [cited by applicant]
US 20040093266A1 · Dohring · 2004 [cited by applicant]
US 20040119760A1 · Grossman et al. · 2004 [cited by applicant]
US 20050021750A1 · Abrams · 2005 [cited by applicant]
US 20050160001A1 · Lapre et al. · 2005 [cited by applicant]
US 20050216338A1 · Tseng et al. · 2005 [cited by applicant]
US 20050235062A1 · Lunt et al. · 2005 [cited by applicant]
US 20060009994A1 · Hogg et al. · 2006 [cited by applicant]
US 20060121990A1 · Okelley et al. · 2006 [cited by applicant]
US 20060242554A1 · Gerace et al. · 2006 [cited by applicant]
US 20060282328A1 · Gerace et al. · 2006 [cited by applicant]
US 20060287920A1 · Perkins et al. · 2006 [cited by applicant]
US 20070100686A1 · Murakami et al. · 2007 [cited by applicant]
US 20070226248A1 · Darr · 2007 [cited by applicant]
US 20070255721A1 · Chess et al. · 2007 [cited by applicant]
US 20070255807A1 · Hayashi et al. · 2007 [cited by applicant]
US 20070282877A1 · Fischer et al. · 2007 [cited by applicant]
US 20080046458A1 · Tseng et al. · 2008 [cited by applicant]
US 20080052203A1 · Beyer et al. · 2008 [cited by applicant]
US 20080098087A1 · Lubeck · 2008 [cited by applicant]
US 20080098313A1 · Pollack · 2008 [cited by applicant]
US 20080140650A1 · Stackpole · 2008 [cited by examiner]
US 20080235216A1 · Ruttenberg · 2008 [cited by applicant]
US 20090063630A1 · Obasanjo et al. · 2009 [cited by applicant]
US 20090089678A1 · Sacco et al. · 2009 [cited by applicant]
US 20090192861A1 · Suzuki et al. · 2009 [cited by applicant]
US 20090198675A1 · Mihalik · 2009 [cited by examiner]
US 20090234945A1 · Chande · 2009 [cited by examiner]
US 20090241035A1 · Tseng et al. · 2009 [cited by applicant]
US 20090248436A1 · Takagi et al. · 2009 [cited by applicant]
US 20090282144A1 · Sherrets · 2009 [cited by examiner]
US 20100088246A1 · Lim · 2010 [cited by applicant]
US 20100088369A1 · Sebastian et al. · 2010 [cited by applicant]
US 20100125599A1 · Cheng et al. · 2010 [cited by applicant]
US 20100198836A1 · Glass et al. · 2010 [cited by applicant]
US 20100205541A1 · Rapaport · 2010 [cited by examiner]
US 20100241580A1 · Schleier-Smith · 2010 [cited by applicant]
US 20110178851A1 · Tseng et al. · 2011 [cited by applicant]
US 20110225102A1 · Schleier-Smith · 2011 [cited by applicant]
US 20120166532A1 · Juan · 2012 [cited by examiner]
US 20120271831A1 · Narayanan · 2012 [cited by examiner]
US 20130046770A1 · Tseng · 2013 [cited by examiner]
US 20130346545A1 · Petersen · 2013 [cited by examiner]
US 20140258159A1 · Schleier-Smith · 2014 [cited by applicant]
US 20140297423A1 · Tseng et al. · 2014 [cited by applicant]
US 20150127565A1 · Chevalier · 2015 [cited by examiner]
CN 101179462A · 2008 [cited by applicant]
EP 1574979A1 · 2005 [cited by applicant]
EP 2270731A1 · 2011 [cited by applicant]
EP 2409271A2 · 2012 [cited by applicant]
JP 2000066970A · 2000 [cited by applicant]
JP 2005259074A · 2005 [cited by applicant]
JP 2006158956A · 2006 [cited by applicant]
JP 2007328723A · 2007 [cited by applicant]
JP 2008123233A · 2008 [cited by applicant]
KR 100643480B1 · 2006 [cited by applicant]
WO 2008020992A2 · 2008 [cited by applicant]
WO 2008020992A3 · 2008 [cited by applicant]
WO 2010107566A2 · 2010 [cited by applicant]
WO 2010107566A3 · 2010 [cited by applicant]
Bannan, Karen J., “Its Catching”; V41 n23; pp IQ20-IQ26, Jun. 5, 2000; Dialog File 15. [cited by applicant]
Dunn, Dan T., Jr.; PROBSTEIN, Sidney C., “Marketing High Tech Services,” Review of Business v24n1; pp. 1-7, Winter 2003; Dialog file 15. [cited by applicant]
Furukawa, J., “Design and evaluation for communication support system using attribute and behavior of user in social network,” Proceedings of the 70th Annual Convention IPS Japan, Information Processing Society of Japan… [cited by applicant]
Leskovec, Jure; Huttenlocher, Daniel; Kleinberg, Jon. Signed Networks in Social Media. Cornell University. CHI 2010, Apr. 10-15, 2010, Atlanta, Georgia, USA. <http://www.cs.cornell.edu/home/kleinber/chi1 0-signed.pdf>. [cited by applicant]
Tokunaga, T., “System for posting/browsing brog utilizing communication history records in community,” FIT2007 The 6th Forum on Information Technology, Information Processing Society of Japan, Aug. 22, 2007, pp. 213-214. [cited by applicant]
Hanneman, Robert A., “Introduction to Social Network Materials”, waybackmachine; <URL:https://web.archive.org/web/2005; //www.faculty.ucr.edu/-hanneman/nettext/C10_Centrality., Nov. 24, 2005, 24 pages. [cited by applicant]