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

公开(公告)号：US10395321B2

公开(公告)日：2019-08-27

申请号：US13690088

申请日：2012-11-30

Applicant: Facebook, Inc.

Inventor： Alon Michael Shalita ,  Ming Hua ,  Ryan Allen Stout

IPC: G06Q30/02 ,  G06Q50/00

Abstract: Online systems, for example, social networking systems evaluate expressions based on features describing relations between entities represented in the online system. These expressions are represented using an expression language. The expression language allows features to be specified as functions of attributes from user accounts. The expressions support use of variables to represent computations, for example, sub-expressions. The expressions are dynamic, since expressions can be specified and executed at call time. The same set of expressions is used many times, e.g., to compute the same function for multiple feature sets, for example, user accounts. Expressions are preferably represented using postfix representation. However some expressions, for example, expressions using variables are represented as trees. To optimize the expressions at runtime, the expressions are cached using a representation determined to be efficient for executing the expression. The cached representation of the expression is applied to multiple feature sets, for example, user accounts.

公开(公告)号：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.

公开(公告)号：US09569553B2

公开(公告)日：2017-02-14

申请号：US15059252

申请日：2016-03-02

Applicant: FACEBOOK, INC.

Inventor： Wayne Kao ,  Bo Zhang ,  Francis Luu ,  Ming Hua

IPC: G06F17/30

CPC classification number: G06F17/30884 ,  G06F17/3053 ,  G06F17/30598 ,  G06F17/30882 ,  G06Q50/01

Abstract: A social networking system provides a personalized set of bookmarks to a user based on the user's interactions with the bookmarks and/or the items associated with the bookmarks. The personalized set of bookmarks is grouped by category, and the categories are ordered in accordance with rankings for the categories. The rankings for the categories are determined based on the highest ranked item from each category of item, and the ranking of the items is determined based on the user's interactions with the bookmarks and/or associated items.

Abstract translation: 社交网络系统基于用户与书签和/或与书签相关联的项目的交互来向用户提供个性化的一组书签。 个性化的书签集合按类别分组，类别根据类别的排名进行排序。 类别的排名基于来自每个类别的项目的最高排名的项目来确定，并且项目的排名基于用户与书签和/或相关项目的交互来确定。

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

公开(公告)号：US09450992B2

公开(公告)日：2016-09-20

申请号：US14061516

申请日：2013-10-23

Applicant: Facebook, Inc.

Inventor： Ashish Wahi ,  Andrew Rothbart ,  Ming Hua ,  Rose Yao

IPC: H04L29/06 ,  G06F15/16 ,  G06Q50/00

CPC classification number: H04L65/403 ,  G06Q10/10 ,  G06Q50/01

Abstract: In one embodiment, one or more server computing devices receive, from a client computing device, a request for first information associated with a first node of a graph. The one or more server computing devices determine whether the first node is associated with a cluster of nodes. A cluster of nodes includes one or more concept nodes of the graph that are related to each other. When the first node is associated with a cluster of nodes, the one or more server computing devices access the cluster of nodes that the first node is associated with, obtain second information from one or more of the nodes in the cluster of nodes that the first node is associated with, and provide the second information for rendering by the client computing device.

Abstract translation: 在一个实施例中，一个或多个服务器计算设备从客户端计算设备接收对与图的第一节点相关联的第一信息的请求。 一个或多个服务器计算设备确定第一节点是否与节点簇相关联。 节点簇包括图形中彼此相关的一个或多个概念节点。 当第一节点与节点集群相关联时，一个或多个服务器计算设备访问第一节点相关联的节点集群，从节点簇中的一个或多个节点获得第二信息， 节点与由客户端计算设备呈现的第二信息相关联并提供第二信息。

公开(公告)号：US09195705B2

公开(公告)日：2015-11-24

申请号：US14278382

申请日：2014-05-15

Applicant: Facebook, Inc.

Inventor： Ryan Allen Stout ,  Ming Hua ,  Hong Yan

IPC: G06F17/30 ,  G06Q50/00 ,  G06Q10/10

CPC classification number: G06F17/30386 ,  G06F17/30867 ,  G06Q10/101 ,  G06Q50/01

Abstract: Online systems, for example, social networking systems store features describing relations between entities represented in the online system. The information describing the features is represented as a graph. The online system maintains a cumulative feature graph and an incremental feature graph. Feature values based on recent user actions are stored in the incremental graph and feature values based on previous actions are stored in the cumulative graph. Periodically, the information stored in the incremental feature graph is merged with the information stored in the cumulative feature graph. The incremental graph is marked as inactive during the merge and information based on new user actions is stored in an active incremental feature graph. If a request for feature information is received, the feature information obtained from the cumulative feature graph, inactive incremental feature graph and the active incremental feature graph are combined to determine the feature information.

Abstract translation: 在线系统，例如，社交网络系统存储描述在线系统中表示的实体之间的关系的特征。 描述特征的信息表示为图形。 在线系统维护累积特征图和增量特征图。 基于最近用户动作的特征值存储在增量图中，基于先前动作的特征值存储在累积图中。 定期地，存储在增量特征图中的信息与存储在累积特征图中的信息合并。 增量图在合并期间被标记为不活动，而基于新用户操作的信息存储在活动增量特征图中。 如果接收到对特征信息的请求，则从累积特征图，非活动增量特征图和活动增量特征图获得的特征信息被组合以确定特征信息。

公开(公告)号：US09070141B2

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

申请号：US13690254

申请日：2012-11-30

Applicant: Facebook, Inc.

Inventor： Ming Hua ,  Hong Yan

IPC: G06Q10/10 ,  G06Q30/02 ,  G06Q50/00

CPC classification number: G06F17/30958 ,  G06F17/30345 ,  G06Q30/0251 ,  G06Q50/01 ,  H04L65/403

Abstract: Online systems, for example, social networking systems store features describing relations between entities represented in the online system. The information describing the features is represented as a graph. The online system maintains a cumulative feature graph and an incremental feature graph. Feature values based on recent user actions are stored in the incremental graph and feature values based on previous actions are stored in the cumulative graph. Periodically, the information stored in the incremental feature graph is merged with the information stored in the cumulative feature graph. The incremental graph is marked as inactive during the merge and information based on new user actions is stored in an active incremental feature graph. If a request for feature information is received, the feature information obtained from the cumulative feature graph, inactive incremental feature graph and the active incremental feature graph are combined to determine the feature information.

Abstract translation: 在线系统，例如，社交网络系统存储描述在线系统中表示的实体之间的关系的特征。 描述特征的信息表示为图形。 在线系统维护累积特征图和增量特征图。 基于最近用户动作的特征值存储在增量图中，基于先前动作的特征值存储在累积图中。 定期地，存储在增量特征图中的信息与存储在累积特征图中的信息合并。 增量图在合并期间被标记为不活动，而基于新用户操作的信息存储在活动增量特征图中。 如果接收到对特征信息的请求，则从累积特征图，非活动增量特征图和活动增量特征图获得的特征信息被组合以确定特征信息。

公开(公告)号：US20140156745A1

公开(公告)日：2014-06-05

申请号：US13690338

申请日：2012-11-30

Applicant: Facebook, Inc.

Inventor： Ming Hua ,  Hong Yan

IPC: G06F15/16

CPC classification number: H04L67/1095 ,  H04L67/1029 ,  H04L67/1034 ,  H04L67/306 ,  H04L69/40

Abstract: Online systems store information describing a large number of users in order to process requests accessing the user information. The user information is distributed across multiple servers. The distribution is performed so that the information is available even if one or more servers fail. The user information is distributed across a first set of servers and a second copy of the user information is distributed across a second set of servers. The user information from each server of the first set is uniformly distributed across multiple servers from the second set, for example, using random distribution, round robin strategy, or any other strategy that uniformly distributes the information across a given set of processors. Requests previously directed to a failed server are redistributed across multiple servers thereby load balancing the processing of these requests.

Abstract translation: 在线系统存储描述大量用户的信息，以处理访问用户信息的请求。 用户信息分布在多个服务器上。 执行分发，使得即使一个或多个服务器发生故障，信息也可用。 用户信息分布在第一组服务器上，并且用户信息的第二副本分布在第二组服务器上。 来自第一组的每个服务器的用户信息均匀地分布在来自第二组的多个服务器上，例如使用随机分布，循环策略或在给定的一组处理器上均匀分布信息的任何其他策略。 以前指向故障服务器的请求将跨多个服务器重新分配，从而负载平衡这些请求的处理。