Goal-oriented user matching among social networking environments
First Claim
1. A method for matching users among a computerized network, the method comprising:
- a processor receiving one or more goals from a querying user and storing the one or more goals in an electronic storage medium;
the processor receiving one or more selection criteria from the querying user, the selection criteria relating to attributes of a desired set of candidate users to collaborate with the querying user;
the processor receiving, from the querying user, a desired degree of social network separation between the querying user and the desired set of candidate users to collaborate with the querying user in achieving the one or more goals;
the processor storing the one or more selection criteria in the electronic storage medium;
the processor weighting one or more selection criteria relative to one another;
the processor prioritizing the one or more selection criteria based on a corresponding weight derived from the weighting;
the processor searching a set of social networks based on the set of goals, the desired degree of social network separation, and the prioritized selection criteria, for a set of candidate users; and
the processor ranking the set of candidate users based on a likelihood of each candidate user in the set of candidate users matching the set of goals and the set of criteria;
wherein the desired degree of social network separation comprises a numerical indicator of a maximum number of connected nodes between a node corresponding to the querying user and a set of nodes corresponding to the set of candidate users.
1 Assignment
0 Petitions
Accused Products
Abstract
Embodiments of the present invention provide an approach for goal-based user matching among social networking environments. In a typical embodiment, a querying user is asked to respond to a series of questions related to goals, criteria, and criteria priorities (and, optionally, a desired “degree” of separation among other users). The querying user will submit his/her responses, which are then parsed and prioritized accordingly. Based on the responses, social networking sites are then searched to identify a set (e.g., at least one) of candidate users that are potential collaboration partners with the querying user. This set of candidate users may be arranged in a list and sorted according to a best match to the querying user'"'"'s responses. The list can then be provided to the querying user. In addition, invites can be sent to the set of candidate users to invite such users to connect/collaborate with the querying user.
-
Citations
17 Claims
-
1. A method for matching users among a computerized network, the method comprising:
-
a processor receiving one or more goals from a querying user and storing the one or more goals in an electronic storage medium; the processor receiving one or more selection criteria from the querying user, the selection criteria relating to attributes of a desired set of candidate users to collaborate with the querying user; the processor receiving, from the querying user, a desired degree of social network separation between the querying user and the desired set of candidate users to collaborate with the querying user in achieving the one or more goals; the processor storing the one or more selection criteria in the electronic storage medium; the processor weighting one or more selection criteria relative to one another; the processor prioritizing the one or more selection criteria based on a corresponding weight derived from the weighting; the processor searching a set of social networks based on the set of goals, the desired degree of social network separation, and the prioritized selection criteria, for a set of candidate users; and the processor ranking the set of candidate users based on a likelihood of each candidate user in the set of candidate users matching the set of goals and the set of criteria; wherein the desired degree of social network separation comprises a numerical indicator of a maximum number of connected nodes between a node corresponding to the querying user and a set of nodes corresponding to the set of candidate users. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
-
8. A system for matching users among social networking environments, the system comprising:
-
a bus; a computer-readable storage device coupled to the bus; a processor coupled to the bus; program instructions, stored on the computer-readable storage device for execution by the processor, to receive one or more goals from a querying user and storing the one or more goals in an electronic storage medium; program instructions, stored on the computer-readable storage device for execution by the processor, to receive one or more selection criteria from the querying user, the selection criteria relating to attributes of a desired set of candidate users to collaborate with the querying user; program instructions, stored on the computer-readable storage device for execution by the processor, to receive from the querying user, a desired degree of social network separation between the querying user and the desired set of candidate users to collaborate with the querying user in achieving the one or more goals; program instructions, stored on the computer-readable storage device for execution by the processor, to store the one or more selection criteria in the electronic storage medium; program instructions, stored on the computer-readable storage device for execution by the processor, to weight one or more selection criteria relative to one another; program instructions, stored on the computer-readable storage device for execution by the processor, to prioritize the one or more selection criteria based on a corresponding weight derived from the weighting; program instructions, stored on the computer-readable storage device for execution by the processor, to search a set of social networks based on the set of goals, the desired degree of social network separation, and the prioritized selection criteria, for a set of candidate users; and program instructions, stored on the computer-readable storage device for execution by the processor, to rank the set of candidate users based on a likelihood of each candidate user in the set of candidate users matching the set of goals and the set of criteria; wherein the desired degree of social network separation comprises a numerical indicator of a maximum number of connected nodes between a node corresponding to the querying user and a set of nodes corresponding to the set of candidate users. - View Dependent Claims (9, 10, 11, 12)
-
-
13. A computer program product for matching users among social networking environments, the computer program product comprising:
-
a computer-readable storage device; program instructions, stored on the computer-readable storage device, to receive one or more goals from a querying user and storing the one or more goals in an electronic storage medium; program instructions, stored on the computer-readable storage device, to receive one or more selection criteria from the querying user, the selection criteria relating to attributes of a desired set of candidate users to collaborate with the querying user; program instructions, stored on the computer-readable storage device to receive, from the querying user, a desired degree of social network separation between the querying user and the desired set of candidate users to collaborate with the querying user in achieving the one or more goals; program instructions, stored on the computer-readable storage device, to store the one or more selection criteria in the electronic storage medium; program instructions, stored on the computer-readable storage device, to weight one or more selection criteria relative to one another; program instructions, stored on the computer-readable storage device, to prioritize the one or more selection criteria based on a corresponding weight derived from the weighting; program instructions, stored on the computer-readable storage device, to search a set of social networks based on the set of goals, the desired degree of social network separation, and the prioritized selection criteria, for a set of candidate users; and program instructions, stored on the computer-readable storage device, to rank the set of candidate users based on a likelihood of each candidate user in the set of candidate users matching the set of goals and the set of criteria; wherein the desired degree of social network separation comprises a numerical indicator of a maximum number of connected nodes between a node corresponding to the querying user and a set of nodes corresponding to the set of candidate users. - View Dependent Claims (14, 15, 16, 17)
-
Specification