Search intent for queries on online social networks

• US 9,367,880 B2
• Filed: 05/03/2013
• Issued: 06/14/2016
• Est. Priority Date: 05/03/2013
• Status: Active Grant

• Current Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Original Assignee: Meta Platforms, Inc. (f/k/a Facebook, Inc.)
• Inventors: Raina, Rajat, Dhamdhere, Kedar, Chatot, Olivier
• Primary Examiner(s): MACKES, KRIS E
• Application Number:
  US13/887,015
• Publication Number:
  US 20140330818A1
• Time in Patent Office: 1,138 Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24565 Triggers; Constraints
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/9024 Graphs; Linked lists G06F16/9027 takes precedence
• CPC Class Codes: G06F 16/9535 Search customisation based on user profiles and personalisation
• CPC Class Codes: G06Q 30/02 Marketing; Price estimation or determination; Fundraising
• CPC Class Codes: G06Q 30/0256 User search
• CPC Class Codes: G06Q 50/01 Social networking

Abstract

In one embodiment, a method includes accessing a social graph that includes a plurality of nodes and edges, receiving from a user a structured query comprising references to selected nodes and selected edges, generating search results corresponding to the structured query, determine a search intent based on the selected nodes or selected edges referenced in the structured query, and scoring the search results based on the search intent.

Claims

1. 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 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 from the first user a structured query comprising references to one or more selected nodes from the plurality of nodes and one or more selected edges from the plurality of edges;

generating one or more search results corresponding to the structured query, wherein each search result corresponds to a node of the plurality of nodes;

determining one or more search intents based at least on whether one or more of the selected nodes or one or more of the selected edges referenced in the structured query match nodes or edges corresponding to a search intent indexed in a pattern-detection model; and

scoring the search results based on one or more of the search intents.

2. The method of claim 1, wherein determining the one or more search intents comprises identifying one or more search intents that correspond to one or more of the selected nodes or one or more of the selected edges.

3. The method of claim 1, wherein determining the one or more search intents comprises:

accessing the pattern-detection model that indexes one or more nodes of the plurality of nodes or one or more edges of the plurality of edges as corresponding to one or more search intents;

determining whether any of the selected nodes or selected edges referenced in the structured query match the nodes or edges indexed in the pattern-detection model; and

identifying, for each matching node or edge, one or more search intents indexed in the pattern-detection model as corresponding to the matching node or edge.

4. The method of claim 1, wherein determining the one or more search intents is further based on a search history associated with the first user.

5. The method of claim 1, wherein the structured query comprises one or more n-grams, and wherein determining the one or more search intents is further based on one or more of the n-grams in the structured query.

6. The method of claim 5, wherein determining the one or more search intents based on one or more of the n-grams in the structured query comprises identifying one or more search intents that correspond to one or more of the n-grams.

7. The method of claim 1, wherein the first node is associated with a profile page of the online social network, and wherein determining the one or more search intents is further based on user information from the profile page.

8. The method of claim 1, further comprising generating a query command based on the structured query, the query command comprising one or more query constraints.

9. The method of claim 8, wherein determining the one or more search intents is further based on one or more of the query constraints of the query command.

10. The method of claim 8, wherein each search result is associated with one or more objects, and wherein each of the one or more query constraints is satisfied by one or more of the objects of the search result.

11. The method of claim 10, wherein scoring the search results based on one or more of the search intents comprises scoring each search result based on a count of the objects of the search result that satisfy the one or more query constraints.

12. The method of claim 10, wherein scoring the search results based on one or more of the search intents comprises scoring each search result based on a ratio of the objects of the search result that satisfy the one or more query constraints to a total number of objects of the search result.

13. The method of claim 10, wherein the query command comprises a plurality of query constraints, and wherein scoring the search results based on one or more of the search intents comprises scoring each search result based on a count of the objects of the search result that satisfy at least two of the plurality of query constraints.

14. The method of claim 10, wherein the one or more objects associated with each search result comprise content of a profile page of the online social network associated with the search result, the profile page being associated with the node corresponding to the search result.

15. The method of claim 1, wherein scoring the search results based on one or more of the search intents comprise scoring the search results based on a degree of separation between the first node and the node corresponding to the search result.

16. The method of claim 1, wherein scoring the search results based on one or more of the search intents comprise scoring the search results based on a social-graph affinity associated with the first node.

17. The method of claim 1, further comprising:

identifying one or more advertisements to display to the user based on one or more of the search intents; and

sending the one or more advertisements to the user.

18. The method of claim 1, further comprising sending one or more of the search results to the first user.

19. 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 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 from the first user a structured query comprising references to one or more selected nodes from the plurality of nodes and one or more selected edges from the plurality of edges;

generate one or more search results corresponding to the structured query, wherein each search result corresponds to a node of the plurality of nodes;

determine one or more search intents based at least on whether one or more of the selected nodes or one or more of the selected edges referenced in the structured query match nodes or edges corresponding to a search intent indexed in a pattern-detection model; and

score the search results based on one or more of the search intents.

20. 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 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 from the first user a structured query comprising references to one or more selected nodes from the plurality of nodes and one or more selected edges from the plurality of edges;

generate one or more search results corresponding to the structured query, wherein each search result corresponds to a node of the plurality of nodes;

determine one or more search intents based at least on whether one or more of the selected nodes or one or more of the selected edges referenced in the structured query match nodes or edges corresponding to a search intent indexed in a pattern-detection model; and

score the search results based on one or more of the search intents.