Grouping Recommended Search Queries on Online Social Networks

• US 20150178283A1
• Filed: 04/22/2014
• Published: 06/25/2015
• Est. Priority Date: 12/19/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: Garg, Avichal, Hua, Ming, Chakradeo, Saurabh Prafulla
• Granted Patent: US 9,367,629 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/248 Presentation of query results
• CPC Class Codes: G06F 16/285 Clustering or classification
• CPC Class Codes: G06F 16/332 Query formulation
• CPC Class Codes: G06F 16/3323 using document space presentation or visualization, e.g. category, hierarchy or range presentation and selection
• CPC Class Codes: G06F 16/3328 using graphical result space presentation or visualisation
• CPC Class Codes: G06F 16/335 Filtering based on additional data, e.g. user or group profiles filtering in web context G06F16/9535, G06F16/9536
• CPC Class Codes: G06F 16/35 Clustering; Classification
• 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: G06F 3/0482 Interaction with lists of selectable items, e.g. menus
• CPC Class Codes: G06F 3/04842 Selection of displayed objects or displayed text elements G06F3/0482 takes precedence
• CPC Class Codes: G06Q 50/01 Social networking
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/02 based on web technology, e.g. hypertext transfer protocol [HTTP]
• CPC Class Codes: H04L 67/10 in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46

Abstract

In one embodiment, a method includes accessing a social graph that includes a number of nodes and edges connecting the nodes. Each of the edges between two of the nodes representing a single degree of separation between them. The nodes include 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. The method also includes generating a number of cards. Each card includes a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain. Each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges.

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;

generating a plurality of cards, each card comprising a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain, wherein each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges;

calculating a card-affinity for each card of the plurality of cards with respect to the other cards of the plurality of cards;

generating one or more card clusters from the plurality of cards, each card cluster comprising one or more cards that each have a card-affinity with respect to the other cards in the card cluster that is greater than a threshold card-affinity; and

sending one or more card clusters to the first user for display on a page currently accessed by the first user.

2. The method of claim 1, further comprising modifying one or more of the query-filters of one or more cards of the card cluster based on previous actions of the first user in relation to one or more of the cards.

3. The method of claim 2, further comprising modifying one or more cards of the card cluster sent to the first user based on the modified query-filters.

4. The method of claim 1, further comprising modifying the order of one or more subsequent cards of the card cluster based on actions of the first user with respect to one or more previously displayed cards.

5. The method of claim 1, further comprising calculating a user-engagement score for each card in each card cluster based on one or more user-engagement factors, wherein the user-engagement score of each card in each card cluster is above a threshold user-engagement score.

6. The method of claim 5, wherein one or more of the user-engagement factors comprise one or more of demographic information, current information, or social-graph information of the first user.

7. The method of claim 1, further comprising updating the card-affinity of one or more subsequent cards of the card cluster based on a current action of the first user in relation to a currently displayed card.

8. The method of claim 1, wherein the card-affinity is calculated at least in part based on the query-domain of each card.

9. The method of claim 1, wherein the card-affinity is calculated at least in part based on the one or more query-filters of the card.

10. The method of claim 1, wherein the card-affinity is calculated at least in part on calculating the card-affinity comprises identifying one or more edges connecting a first node corresponding to another user to one or more of the second nodes, the other user having at least a subset of demographic information in common with demographic information of the first user.

11. The method of claim 1, further comprising displaying a subsequent card to the first user in response to detecting an input from the first user corresponding to a swipe of a previously displayed card, the subsequent card having a same query-domain and one or more different query-filters as the previously displayed card.

12. The method of claim 1, further comprising displaying a subsequent card of the card cluster to the first user in response to detecting an input from the first user corresponding to a swipe of a previously displayed card, the subsequent card having a same query-domain and one or more different query-filters as the previously displayed card.

13. The method of claim 1, wherein, for each card cluster, each card corresponds to a suggested query referencing a particular query-domain and a different query-filter.

14. The method of claim 1, wherein, for each card cluster, each card corresponds to a suggested query referencing a particular query-filter and a different query-domain.

15. The method of claim 1, wherein, for each card cluster, one or more cards of the card cluster correspond to a suggested query referencing a particular query-domain, a particular first query-filter, and a plurality of second query-filters.

16. The method of claim 1, wherein the card cluster is displayed on the page as a stack of cards.

17. The method of claim 1, wherein the page is a user interface of a native application.

18. The method of claim 1, wherein the page is a webpage of a social-networking system accessed by a browser client.

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;

generate a plurality of cards, each card comprising a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain, wherein each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges;

calculate a card-affinity for each card of the plurality of cards with respect to the other cards of the plurality of cards;

generate one or more card clusters from the plurality of cards, each card cluster comprising one or more cards that each have a card-affinity with respect to the other cards in the card cluster that is greater than a threshold card-affinity; and

send one or more card clusters to the first user for display on a page currently accessed by the first user.

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;

generate a plurality of cards, each card comprising a suggested query referencing a query-domain associated with the online social network and zero or more query-filters for the query-domain, wherein each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges;

calculate a card-affinity for each card of the plurality of cards with respect to the other cards of the plurality of cards;

generate one or more card clusters from the plurality of cards, each card cluster comprising one or more cards that each have a card-affinity with respect to the other cards in the card cluster that is greater than a threshold card-affinity; and

send one or more card clusters to the first user for display on a page currently accessed by the first user.