US 8,185,558 B1Granted

Automatically generating nodes and edges in an integrated social graph

AssigneeFacebook, Inc.

InventorsSrinivas Narayanan, Nandagopal Venkataramanan, Eric Sun

Life of this patent

Estimating the term…

Loading patent…

Abstract

In one embodiment, a method includes maintaining a data store of nodes and edges and for each of one or more users: scanning items of content associated with the corresponding user node; identifying a candidate item of content; searching for matches between the candidate item of content and existing nodes; determining whether or not a match between the candidate item of content and an existing node exists; and when it is determined that at least one match exists, generating an edge from the user node to the existing node for which the best match is determined; and when it is determined that no match exists, generating a new node based on the candidate item of content, and generating an edge from the user node to the new node.

Claims20

Dependent claims

A method comprising:

maintaining, by one or more computing systems, access to a data store of information corresponding to one or more of a plurality of users of a social network environment and one or more of a plurality of concepts and comprising:
a plurality of nodes including a set of user nodes that each correspond to a respective user, and a set of concept nodes that each correspond to a respective concept, each node of the sets of nodes being associated with a corresponding structured document;
and
a plurality of edges that each define a connection between a corresponding pair of nodes from the plurality of nodes;
for each of one or more users:
scanning, by one or more of the computing systems, one or more items of content stored or identified with the user node corresponding to the user;
identifying, by one or more of the computing systems, a candidate item of content from the one or more items of content;
searching, by one or more of the computing systems, the stored information for one or more matches between the candidate item of content and existing nodes from the set of concept nodes;
determining, by one or more of the computing systems, whether or not a match between the candidate item of content and an existing node from the set of concept nodes exists;
and
when the one or more computing systems determine that at least one match exists:
generating, by one or more of the computing systems, an edge from the node corresponding to the user to the node from the set of concept nodes for which the best match is determined;
and
when the one or more computing systems determine that no match between the candidate item of content and an existing node from the set of concept nodes exists:
generating, by one or more of the computing systems, a new node in the set of concept nodes based on the candidate item of content;
and
generating, by the one or more computing systems, an edge from the node corresponding to the user to the new node.

14 more elements

A system comprising:

one or more processors;
and
logic encoded in one or more computer-readable tangible storage media that, when executed by the one or more processors, is operable to:
maintain access to a data store of information corresponding to one or more of a plurality of users of a social network environment and one or more of a plurality of concepts and comprising:
a plurality of nodes including a set of user nodes that each correspond to a respective user, and a set of concept nodes that each correspond to a respective concept, each node of the sets of nodes being associated with a corresponding structured document;
and
a plurality of edges that each define a connection between a corresponding pair of nodes from the plurality of nodes;
for each of one or more users:
scan one or more items of content stored or identified with the user node corresponding to the user;
identify a candidate item of content from the one or more items of content;
search the stored information for one or more matches between the candidate item of content and existing nodes from the set of concept nodes;
determine whether or not a match between the candidate item of content and an existing node from the set of concept nodes exists;
and
when the one or more computing systems determine that at least one match exists:
generate an edge from the node corresponding to the user to the node from the set of concept nodes for which the best match is determined;
and
when the one or more computing systems determine that no match between the candidate item of content and an existing node from the set of concept nodes exists:
generate a new node in the set of concept nodes based on the candidate item of content;
and
generate an edge from the node corresponding to the user to the new node.

17 more elements

Dependencies are inferred from the claim text.

Facts

Application: 12/763,145Filed 19 Apr 2010
Granted: 22 May 2012
Term ends: Not estimatedThe source records don’t support an estimate.

Classification14 codes

G06F 16/24578
With adaptation to user needs: using ranking
G06F 3/0482
Based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like…:…
G06F 3/04842
For the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a…:…
G06F 16/24
Of structured data, e.g. relational data: querying