Social discovery and ranking of pages
First Claim
Patent Images
1. A method comprising:
- by one or more computing devices,accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising;
a first user node corresponding to a first user of an online social network;
a plurality of second user nodes corresponding to a plurality of second users of the online social network, respectively; and
one or more location nodes corresponding to one or more locations, respectively,wherein each location node is connected to one or more user nodes by one or more edges, respectively;
receiving from the first user a search query comprising location parameters;
identifying a first set of location nodes based on the search query, each location node of the first set of location nodes being connected to one or more user nodes by one or more edges, each edge having a particular attribute;
determining a value for each location node of the first set of location nodes based on a number of edges connected to the location node and the attributes of the edges connected to the location node; and
ranking the location nodes of the first set of location nodes based at least in part on the determined value for the location nodes.
2 Assignments
0 Petitions
Accused Products
Abstract
In one embodiment, a social-networking system accesses a social graph with a plurality of user nodes and a plurality of location nodes, receives a search query with location parameters, identifies a set of location nodes based on the search query, and determines a value for each location nodes in the set based on the edges connected to the location nodes in the social graph.
-
Citations
14 Claims
-
1. A method comprising:
- by one or more computing devices,
accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising; a first user node corresponding to a first user of an online social network; a plurality of second user nodes corresponding to a plurality of second users of the online social network, respectively; and one or more location nodes corresponding to one or more locations, respectively, wherein each location node is connected to one or more user nodes by one or more edges, respectively; receiving from the first user a search query comprising location parameters; identifying a first set of location nodes based on the search query, each location node of the first set of location nodes being connected to one or more user nodes by one or more edges, each edge having a particular attribute; determining a value for each location node of the first set of location nodes based on a number of edges connected to the location node and the attributes of the edges connected to the location node; and ranking the location nodes of the first set of location nodes based at least in part on the determined value for the location nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12)
- by one or more computing devices,
-
13. An apparatus comprising:
- one or more processors; and
a memory coupled to the processors comprising instructions executable by the processors, the processors operable when executing the instructions to;access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising; a first user node corresponding to a first user of an online social network; a plurality of second user nodes corresponding to a plurality of second users of the online social network, respectively; and one or more location nodes corresponding to one or more locations, respectively, wherein each location node is connected to one or more user nodes by one or more edges, respectively; receive from the first user a search query comprising location parameters; identify a first set of location nodes based on the search query, each location node of the first set of location nodes being connected to one or more user nodes by one or more edges, each edge having a particular attribute; determine a value for each location node of the first set of location nodes based on a number of edges connected to the location node and the attributes of the edges connected to the location node; and ranking the location nodes of the first set of location nodes based at least in part on the determined value for the location nodes.
- one or more processors; and
-
14. One or more computer-readable non-transitory storage media embodying software that is operable when executed to:
-
access a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each edge between two nodes representing a single degree of separation between the two nodes, the plurality of nodes comprising; a first user node corresponding to a first user of an online social network; a plurality of second user nodes corresponding to a plurality of second users of the online social network, respectively; and one or more location nodes corresponding to one or more locations, respectively, wherein each location node is connected to one or more user nodes by one or more edges, respectively; receive from the first user a search query comprising location parameters; identify a first set of location nodes based on the search query, each location node of the first set of location nodes being connected to one or more user nodes by one or more edges, each edge having a particular attribute; determine a value for each location node of the first set of location nodes based on a number of edges connected to the location node and the attributes of the edges connected to the location node; and ranking the location nodes of the first set of location nodes based at least in part on the determined value for the location nodes.
-
Specification