发明名称 |
Grouping recommended search queries on online social networks |
摘要 |
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. |
申请公布号 |
US9367629(B2) |
申请公布日期 |
2016.06.14 |
申请号 |
US201414258989 |
申请日期 |
2014.04.22 |
申请人 |
Facebook, Inc. |
发明人 |
Garg Avichal;Hua Ming;Chakradeo Saurabh Prafulla |
分类号 |
G06F17/30;H04L29/08;H04L29/06;G06Q50/00 |
主分类号 |
G06F17/30 |
代理机构 |
Baker Botts L.L.P. |
代理人 |
Baker Botts L.L.P. |
主权项 |
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; anda 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. |
地址 |
Menlo Park CA US |