×

Contact Resolution Using Social Graph Information

  • US 20120150955A1
  • Filed: 12/10/2010
  • Published: 06/14/2012
  • Est. Priority Date: 12/10/2010
  • Status: Abandoned Application
First Claim
Patent Images

1. A method for merging an address book with social graph information relative to a first user, the method comprising:

  • accessing a social graph to generate a list of users that are separated by one degree from a first user, wherein the social graph comprises a plurality of nodes, each node corresponding to a respective user, and edge data identifying connections between nodes of the plurality of nodes, wherein a degree of separation between a first node and a second node in the social network graph is a minimum number of hops required to traverse from the first node to the second node;

    each node corresponding to a user profile including a user name and communication channel information;

    accessing an address book of the first user, the address book including one or more contact entries, each contact entry comprising a name and communication channel information;

    merging user profile information from the social graph and the address book by;

    matching, for each user profile associated with the list of users, the user profile to a contact entry in the address book;

    if there is an exact match between the user profile and a contact entry in the address book, associating the user profile and the contact entry as a match;

    if there is a partial match between the user profile and a contact entry in the address book, thenpresenting the contact entry to the first user to confirm the partial match; and

    associating the user profile and the contact entry as a match.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×