公开(公告)号：US10268733B2

公开(公告)日：2019-04-23

申请号：US15147305

申请日：2016-05-05

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Saurabh Prafulla Chakradeo

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

Abstract: In one embodiment, a method includes receiving, from a client system of a first user of a communication network, an input from the first user to access a card-stack interface, generating one or more card clusters from a plurality of cards, each card comprising a query referencing a query-domain associated with the communication network and zero or more query-filters for the query-domain, wherein each query-filter references one or more objects of the communication network, each card cluster comprising one or more cards from the plurality of cards, the cards being formed into card clusters based on a card-affinity between the cards, and sending, to the client system 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 card clusters.

公开(公告)号：US20160371872A1

公开(公告)日：2016-12-22

申请号：US14743952

申请日：2015-06-18

Applicant: Facebook, Inc.

Inventor： Ling Bao ,  Aditya Gopal Bhandarkar ,  Dharmesh A. Bhatt ,  Saurabh Prafulla Chakradeo ,  Sophia Han Chung ,  Kyle Philip Meyer ,  Brandon Douglas Souba ,  Austin Jacob Schleder

IPC: G06T13/80 ,  G06F3/0481 ,  G06F3/0485 ,  G06F3/0484

CPC classification number: G06T13/80 ,  G06F3/0481 ,  G06F3/0484 ,  G06F9/451 ,  G06F2203/04803 ,  G06T2200/24

Abstract: Systems, methods, and non-transitory computer-readable media can present a first interface that provides a first set of content items. A command to present a second interface that provides a second set of content items can be detected. An animation that transitions from the first interface to the second interface can be performed. The animation can cause a second subset of content items out of the second set to be visually representative of a first subset of content items out of the first set.

Abstract translation: 系统，方法和非暂时计算机可读介质可以呈现提供第一组内容项的第一接口。 可以检测到呈现提供第二组内容项目的第二接口的命令。 可以执行从第一接口转换到第二接口的动画。 动画可以使第二组中的内容项的第二子集可视地代表第一组中的内容项的第一子集。

公开(公告)号：US20150178397A1

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

申请号：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/06 ,  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 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

Abstract translation: 在一个实施例中，一种方法包括从在线社交网络的用户的客户端设备接收来自用户的输入以访问卡堆栈接口，生成多个卡，其中每个卡包括引用一个 与在线社交网络相关联的查询域和一个或多个查询过滤器，并且其中每个查询过滤器引用在线社交网络的一个或多个对象，每个卡还包括与建议的查询相对应的一个或多个搜索结果，以及 每个搜索结果引用在线社交网络的对象匹配卡的建议查询; 以及响应于来自所述第一用户的输入，向所述客户端设备发送用于向所述第一用户显示的所述卡堆栈接口，其中所述卡堆栈接口包括所生成的卡中的一个或多个

公开(公告)号：US20180210886A1

公开(公告)日：2018-07-26

申请号：US15927666

申请日：2018-03-21

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 ,  G06F3/0484 ,  G06F3/0482 ,  G06Q50/00 ,  H04L29/06

CPC classification number: G06F16/24578 ,  G06F3/0482 ,  G06F3/04842 ,  G06F16/248 ,  G06F16/285 ,  G06F16/332 ,  G06F16/3323 ,  G06F16/3328 ,  G06F16/335 ,  G06F16/35 ,  G06F16/9024 ,  G06F16/9535 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/10 ,  H04L67/42

Abstract: In one embodiment, a method includes receiving, from a client system of a first user, an input from the first user indicating a query-domain and one or more query-filters, generating a card cluster comprising a plurality of cards referencing a plurality of objects corresponding to the indicated query-domain and one or more query-filters, ranking the plurality of cards based on one or more user-engagement factors, and sending, to the client system in response to the input from the first user, instructions for displaying the card cluster to the first user, the cards of the card cluster being ordered based on the rankings associated with the cards.

公开(公告)号：US20160246890A1

公开(公告)日：2016-08-25

申请号：US15147305

申请日：2016-05-05

Applicant: Facebook, Inc.

Inventor： Avichal Garg ,  Ming Hua ,  Saurabh Prafulla Chakradeo

IPC: G06F17/30 ,  G06F3/0482 ,  H04L29/08 ,  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 system of a first user of a communication network, an input from the first user to access a card-stack interface, generating one or more card clusters from a plurality of cards, each card comprising a query referencing a query-domain associated with the communication network and zero or more query-filters for the query-domain, wherein each query-filter references one or more objects of the communication network, each card cluster comprising one or more cards from the plurality of cards, the cards being formed into card clusters based on a card-affinity between the cards, and sending, to the client system 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 card clusters.

Abstract translation: 在一个实施例中，一种方法包括从客户端系统接收通信网络的第一用户的来自第一用户的输入以访问卡堆栈接口，从多个卡生成一个或多个卡簇，每个卡 包括引用与通信网络相关联的查询域的查询和用于查询域的零个或多个查询过滤器，其中每个查询过滤器引用通信网络的一个或多个对象，每个卡集合包括一个或多个卡， 多个卡片，卡片基于卡片之间的卡片相关性而形成卡片集群，并且响应于来自第一用户的输入向客户端系统发送用于显示给第一用户的卡片堆叠接口 ，其中所述卡堆叠接口包括所述卡簇中的一个或多个。

公开(公告)号：US08949250B1

公开(公告)日：2015-02-03

申请号：US14258821

申请日：2014-04-22

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

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 including a number of nodes and a number of edges connecting the nodes. Each of the edges between two of the nodes represent 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 number 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 number of nodes or one or more edges of the number 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: 在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。 两个节点之间的每个边缘表示它们之间的单一分离度。 节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。 该方法还包括生成多个卡。 每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询，以及查询域的零个或多个查询过滤器。 每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。

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