公开(公告)号：US09460215B2

公开(公告)日：2016-10-04

申请号：US14259001

申请日：2014-04-22

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Michael Vernal ,  Yang Qin ,  Dan Ionut Fechete

IPC: G06F7/00 ,  G06F17/30 ,  H04L29/08 ,  H04L29/06 ,  G06Q50/00

CPC classification number: G06F17/3053 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/30554 ,  G06F17/30598 ,  G06F17/30637 ,  G06F17/30643 ,  G06F17/30651 ,  G06F17/30699 ,  G06F17/30705 ,  G06F17/30867 ,  G06F17/30958 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

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 card cluster including 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. Each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges.

Abstract translation: 在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。 两个节点之间的每个边缘表示它们之间的单一分离度。 节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。 该方法还包括生成包括多个卡的卡簇。 每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询和零个或多个查询过滤器。 每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。

公开(公告)号：US09959320B2

公开(公告)日：2018-05-01

申请号：US14568642

申请日：2014-12-12

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Michael Vernal ,  Yang Qin ,  Dan Ionut Fechete ,  Xinpan Xiao ,  Yu Huang ,  Lu D. Chen ,  Saurabh Prafulla Chakradeo ,  Dharmesh A. Bhatt ,  Alex Himel

IPC: G06F17/30 ,  H04L29/08 ,  H04L29/06 ,  G06Q50/00 ,  G06F3/0482 ,  G06F3/0484

CPC classification number: G06F17/3053 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/30554 ,  G06F17/30598 ,  G06F17/30637 ,  G06F17/30643 ,  G06F17/30651 ,  G06F17/30699 ,  G06F17/30705 ,  G06F17/30867 ,  G06F17/30958 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

Abstract: In one embodiment, a method includes receiving, from a client device of a user of an online social network, an input from the user to access a card-stack interface, generating a plurality of cards, where each card comprises a suggested query referencing a query-domain associated with the online social network and one or more query-filters, and where each query-filter references one or more objects of the online social network, each card further comprising one or more search results corresponding to the suggested query, and each search result referencing an object of the online social network matching the suggested query of the card; and sending, to the client device in response to the input from the first user, the card-stack interface for display to the first user, wherein the card-stack interface comprises one or more of the generated cards.

公开(公告)号：US09367629B2

公开(公告)日：2016-06-14

申请号：US14258989

申请日：2014-04-22

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Saurabh Prafulla Chakradeo

IPC: G06F17/30 ,  H04L29/08 ,  H04L29/06 ,  G06Q50/00

CPC classification number: G06F17/3053 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/30554 ,  G06F17/30598 ,  G06F17/30637 ,  G06F17/30643 ,  G06F17/30651 ,  G06F17/30699 ,  G06F17/30705 ,  G06F17/30867 ,  G06F17/30958 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

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.

Abstract translation: 在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。 两个节点之间的每个边缘表示它们之间的单一分离度。 节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。 该方法还包括生成多个卡。 每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询，以及查询域的零个或多个查询过滤器。 每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。

公开(公告)号：US20150178284A1

公开(公告)日：2015-06-25

申请号：US14259001

申请日：2014-04-22

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Michael Vernal ,  Yang Qin ,  Dan Ionut Fechete

IPC: G06F17/30 ,  H04L29/08

CPC classification number: G06F17/3053 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/30554 ,  G06F17/30598 ,  G06F17/30637 ,  G06F17/30643 ,  G06F17/30651 ,  G06F17/30699 ,  G06F17/30705 ,  G06F17/30867 ,  G06F17/30958 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

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 card cluster including 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. Each query-filter references one or more nodes of the plurality of nodes or one or more edges of the plurality of edges.

Abstract translation: 在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。 两个节点之间的每个边缘表示它们之间的单一分离度。 节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。 该方法还包括生成包括多个卡的卡簇。 每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询和零个或多个查询过滤器。 每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。

公开(公告)号：US20150178283A1

公开(公告)日：2015-06-25

申请号：US14258989

申请日：2014-04-22

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Saurabh Prafulla Chakradeo

IPC: G06F17/30 ,  H04L29/08

CPC classification number: G06F17/3053 ,  G06F3/0482 ,  G06F3/04842 ,  G06F17/30554 ,  G06F17/30598 ,  G06F17/30637 ,  G06F17/30643 ,  G06F17/30651 ,  G06F17/30699 ,  G06F17/30705 ,  G06F17/30867 ,  G06F17/30958 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

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.

Abstract translation: 在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。 两个节点之间的每个边缘表示它们之间的单一分离度。 节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。 该方法还包括生成多个卡。 每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询，以及查询域的零个或多个查询过滤器。 每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。