Pre-Grant Publication Number: 20080059576
Collaborate on the process of community review for this application. Posting will not be forwarded to the USPTO.
Flagging a post as an ACTION ITEM signals further research. Flagging SPAM and ABUSE helps to manage discussion.
Placing double brackets around a reference to a claim or prior art will create a hyperlink to the original
ex. [[claim 1]] and [[prior art 2]].

Discussion (11)
Show without Noise
0 days left







<claim-text> A system for recommending potential contacts for a target user, comprising:<claim-text>a data store containing contact lists of users, including a contact list for the target user;</claim-text><claim-text>a component that identifies, from the contact lists, contact paths from the target user to other users that are within a maximum contact path length;</claim-text><claim-text>a component that ranks users on the identified contact paths based on path lengths of the contact paths;</claim-text><claim-text>a component that filters out users on the identified contact paths who do not satisfy a recommendation criterion; and</claim-text><claim-text>a component that presents to the target user an indication of the ranking of the non-filtered-out users as recommendations for potential contacts.</claim-text></claim-text>
It has a data store (a sql database) containing contact lists of users, a component that identifies from the data store contact paths and lengths of path, methods of ranking and filtering contacts (nodes) from the list. The one piece lacking is presenting a near node as a contact, though that would be obvious when looking at the connection visualization presented. more...
<claim-text> The system of <claim-ref idref='CLM-00001'>claim 1</claim-ref> wherein the component that identifies contact paths traverses a social network formed by the contact lists starting at the contact list of the target user.</claim-text>
<claim-text> The system of <claim-ref idref='CLM-00003'>claim 3</claim-ref> wherein the path score for a contact path decreases exponentially as the path length of the contact path increases.</claim-text>
<claim-text> A system for identifying a social path between a first user and a second user, the social path being within a maximum social path length, comprising:<claim-text>a data store containing contact lists of users, including a contact list for the first user and a contact list for the second user;</claim-text><claim-text>a component that identifies, from the contact lists, contact paths from the first user to other users that are within a first maximum contact path length and contact paths from the second user to other users that are within a second maximum contact path length, wherein the sum of the first maximum contact path length and the second maximum contact path length equals the maximum social path length; and</claim-text><claim-text>a component that, when there is a contact path from the first user to another user and a contact path from the second user to that same other user, indicates that a social path exists from the first user to the second user.</claim-text></claim-text>
<claim-text> The system of <claim-ref idref='CLM-00010'>claim 10</claim-ref> wherein the maximum social path length is six.</claim-text>