US2015269530A1PendingUtilityA1

Representing connection paths between users of a social network

Assignee: LINKEDIN CORPPriority: Sep 2, 2004Filed: Mar 31, 2015Published: Sep 24, 2015
Est. expirySep 2, 2024(expired)· nominal 20-yr term from priority
G06Q 10/40G06F 16/24578G06Q 10/00G06Q 50/01G06F 17/30864G06Q 10/1053H04L 51/52H04L 67/535G06F 16/248G06Q 30/0201G06F 16/2365G06F 16/951G06F 16/958G06F 16/955H04L 65/403G06F 16/9535H04L 67/306G06Q 10/48G06Q 10/46G06Q 10/42G06F 16/9536G06F 16/9538
62
PatentIndex Score
0
Cited by
0
References
0
Claims

Abstract

A method and system for evaluating the reputation of a member of a social networking system is disclosed. Consistent with an embodiment of the invention, one or more attributes associated with a social networking profile of a member of a social network are analyzed. Based on the analysis, a ranking, rating or score is assigned to a particular category of reputation. When requested, the ranking, rating or score is displayed to a user of the social network.

Claims

exact text as granted — not AI-modified
What is claimed: 
     
         1 . A method for generating a visualization of one or more connection paths between a searching member and a target member in a social networking system, the method comprising:
 storing a plurality of relationships between a plurality of members of the social networking system, the plurality of members including the searching member and the target member;   receiving a search request, the search request initiated on behalf of the searching member;   processing the search request to identify a plurality of results, the plurality of results including the target member;   analyzing the plurality of relationships between the searching member and the target member to identify the one or more connection paths between the searching member and the target member;   determining a weighted score for an access indicator which is weighted to adjust for various factors including: level of seniority from current and recent titles, independence, relationship to the searching member, and endorsements and influence of endorsers; and   generating a display profile of the target member for display, the display profile including the visualization of the one or more connection paths between the searching member and the target member, the visualization including a selection of a number of the one or more connection, each of the selection of the number of the one or more connection paths including the weighted access indicator and, based on indicators of affinities between the searching member and the target member, an affinity indicator, wherein the generating of the display profile of the target member is performed by one or more computer processors.   
     
     
         2 . A system for generating a visualization of one or more connection paths between a searching member and a target member in a social networking system, the system comprising:
 a memory comprising a set of instructions;   one or more processors coupled to the memory and configured to, based on the set of instructions,   store a plurality of relationships between a plurality of members of the social networking system, the plurality of members including the searching member and the target member;   receive a search request, the search request initiated on behalf of the searching member;   process the search request to identify a plurality of results, the plurality of results including the target member;   analyze the plurality of relationships between the searching member and the target member to identify the one or more connection paths between the searching member and the target member;   determine a weighted score for an access indicator which is weighted to adjust for various factors including: level of seniority from current and recent titles, independence, relationship to the searching member, and endorsements and influence of endorsers; and   generate a display profile of the target member for display, the display profile including a visualization of the one or more connection paths between the searching member and the target member, the visualization including a depiction of a selection of a number of the one or more connection, the depiction including the weighted access indicators and, based on an indicators of affinities between the searching member and the target member, affinity indicators.   
     
     
         3 . An apparatus for generating a visualization of one or more connection paths between a searching member and a target member in a social networking system, the apparatus comprising:
 means for storing a plurality of relationships between a plurality of members of the social networking system, the plurality of members including the searching member and the target member;   means for receiving a search request, the search request initiated on behalf of the searching member;   means for processing the search request to identify a plurality of results, the plurality of results including the target member;   means for analyzing the plurality of relationships between the searching member and the target member to identify the one or more connection paths between the searching member and the target member;   determining a weighted score for an access indicator which is weighted to adjust for various factors including: level of seniority from current and recent titles, independence, relationship to the searching member, and endorsements and influence of endorsers; and   means for generating a display profile of the target member for display, the display profile including a visualization of the one or more connection paths between the searching member and the target member, the visualization including a depiction of a selection of a number of the one or more connection, the depiction including the weighted access indicators and, based on indicators of an affinities between the searching member and the target member, affinity indicators corresponding to the one or more connection paths.   
     
     
         4 . The method of  claim 1 , wherein at least one of the affinity indicators is represented as hyperlinks. 
     
     
         5 . The method of  claim 1 , wherein the visualization of at least one connection path of the one or more connection paths includes a depiction of one or more affinity connections. 
     
     
         6 . The method of  claim 5 , wherein the one or more affinity connections include one or more group connections. 
     
     
         7 . The method of  claim 6 , wherein the one or more group connections have the same weight as one or more direct connections with respect to an aggregate score for the access indicator, the at least one connection path including a depiction of the one or more direct connections. 
     
     
         8 . The method of  claim 1 , wherein the indicators of the affinities between the searching member and the target member relate to at least one of schools attended, group memberships, active social causes, and professional interests. 
     
     
         9 . The method of  claim 1 , wherein the selection is based on two or more of the following counts being less than a predetermined number: a count of a number of degrees in a shortest path between the searching member and the target member, a count of a number of degrees in a shortest path between the searching member and an endorser of the target member, a count of a number of degrees in a shortest path between the searching member and a reference of the target member. 
     
     
         10 . The system of  claim 2 , wherein at least one of the affinity indicators is represented as hyperlinks. 
     
     
         11 . The system of  claim 2 , wherein the visualization of at least one connection path of the one or more connection paths includes a depiction of one or more affinity connections. 
     
     
         12 . The system of  claim 11 , wherein the one or more affinity connections include one or more group connections. 
     
     
         13 . The system of  claim 12 , wherein the one or more group connections have the same weight as one or more direct connections with respect to an aggregate score for the access indicator, the at least one connection path including a depiction of the one or more direct connections. 
     
     
         14 . The system of  claim 2 , wherein the indicators of the affinities between the searching member and the target member relate to at least one of schools attended, group memberships, active social causes, and professional interests. 
     
     
         15 . The system of  claim 2 , wherein the selection is based on two or more of the following counts being less than a predetermined number: a count of a number of degrees in a shortest path between the searching member and the target member, a count of a number of degrees in a shortest path between the searching member and an endorser of the target member, a count of a number of degrees in a shortest path between the searching member and a reference of the target member. 
     
     
         16 . The apparatus of  claim 3 , wherein at least one of the affinity indicators is represented as hyperlinks. 
     
     
         17 . The apparatus of  claim 3 , wherein the visualization of at least one connection path of the one or more connection paths includes a depiction of one or more affinity connections. 
     
     
         18 . The apparatus of  claim 17 , wherein the one or more affinity connections include one or more group connections. 
     
     
         19 . The apparatus of  claim 18 , wherein the one or more group connections have the same weight as one or more direct connections with respect to an aggregate score for the access indicator, the at least one connection path including a depiction of the one or more direct connections. 
     
     
         20 . The apparatus of  claim 3 , wherein the indicators of the affinities between the searching member and the target member relate to at least one of schools attended, group memberships, active social causes, and professional interests.

Join the waitlist — get patent alerts

Track US2015269530A1 — get alerts on status changes and closely related new filings.

We store only your email — no account needed. See our privacy policy.