Ranking Test Framework for Search Results on an Online Social Network
AssigneeFacebook, Inc.
InventorsSRIRAM SANKAR, KIHYUK HONG
Life of this patent
Estimating the term…
Abstract
In one embodiment, a method includes accessing a social graph comprising a plurality of nodes and edges, receiving a set of scored results from a user that include results generated by a search algorithm in response to a query from the user and a score for each result, where each result corresponds to a node of the social graph, calculating a gain for each result based on the score of the result, and modifying the search algorithm based on the calculated gain.
Claims20
A method comprising, by a computing device:
- accessing a social graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
- a first-user node corresponding to a first user associated with an online social network;
- and
- a plurality of second nodes that each correspond to a concept or a second user associated with the online social network;
- receiving a first set of scored results from the first user comprising:
- one or more results generated by a first search algorithm in response to a query from the first user, wherein each result corresponds to one of the second nodes;
- and
- one or more scores corresponding to the one or more results, respectively;
- calculating a gain for each result in the first set of scored results based on the score corresponding to the result;
- and
- modifying the first search algorithm based on the calculated gain for each result.
A system 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 of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
- a first-user node corresponding to a first user associated with an online social network;
- and
- a plurality of second nodes that each correspond to a concept or a second user associated with the online social network;
- receive a first set of scored results from the first user comprising:
- one or more results generated by a first search algorithm in response to a query from the first user, wherein each result corresponds to one of the second nodes;
- and
- one or more scores corresponding to the one or more results, respectively;
- calculate a gain for each result in the first set of scored results based on the score corresponding to the result;
- and
- modify the first search algorithm based on the calculated gain for each result.
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 of the edges between two of the nodes representing a single degree of separation between them, the nodes comprising:
- a first-user node corresponding to a first user associated with an online social network;
- and
- a plurality of second nodes that each correspond to a concept or a second user associated with the online social network;
- receive a first set of scored results from the first user comprising:
- one or more results generated by a first search algorithm in response to a query from the first user, wherein each result corresponds to one of the second nodes;
- and
- one or more scores corresponding to the one or more results, respectively;
- calculate a gain for each result in the first set of scored results based on the score corresponding to the result;
- and
- modify the first search algorithm based on the calculated gain for each result.
Dependencies are inferred from the claim text.