-
公开(公告)号：US20160335270A1
公开(公告)日：2016-11-17
申请号：US15222072
申请日：2016-07-28
Applicant: Facebook, Inc.
Inventor： Avichal Garg , Ming Hua , Michael S. Vernal , Yang Qin , Dan lonut Fechete
IPC: G06F17/30
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 of the communication system, an input from the first user to access a card-stack interface, generating a card cluster comprising a plurality of cards, each card comprising a suggested query referencing a query-domain and one or more query-filters, wherein each query-filter references one or more objects associated with the communication system, and wherein each card in the card cluster is ranked within the card cluster based on a predicted click-thru rate (CTR) for the card based on one or more user-engagement factors, 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 the card cluster, the cards of the card cluster being ordered based on the rankings associated with the cards.
Abstract translation: 在一个实施例中，一种方法包括从客户端系统接收通信系统的第一用户的来自第一用户的输入以访问卡堆栈接口，生成包括多个卡的卡簇，每个卡包括 建议的查询引用查询域和一个或多个查询过滤器，其中每个查询过滤器引用与通信系统相关联的一个或多个对象，并且其中卡集群中的每个卡基于预测的点击被排在卡集群内 - 基于一个或多个用户参与因素的卡的通过率（CTR），并且响应于来自第一用户的输入向客户端系统发送用于向第一用户显示的卡堆栈接口，其中， 卡堆栈接口包括卡簇，基于与卡相关联的排名来订购卡簇的卡。
-
公开(公告)号：US20150193539A1
公开(公告)日：2015-07-09
申请号：US14147448
申请日：2014-01-03
Applicant: Facebook, Inc.
Inventor： Dan Ionut Fechete , Ming Hua , Yang Qin
IPC: G06F17/30
CPC classification number: G06F17/3053 , G06F17/30867
Abstract: Exemplary methods, apparatuses, and systems receive a candidate object with which a user can interact within a network service. For each of a first plurality of objects with which the user has had a positive interaction, a first value representing a commonality between the candidate object and each of the first plurality of objects is determined. For each of a second plurality of objects with which a user has had a negative interaction, a second value representing a commonality between the candidate object and each of the second plurality of objects is determined. An aggregate positive distance is determined using a plurality of the first values. An aggregate negative distance is determined using a plurality of the second values. The candidate object is displayed or not displayed to the user as a recommendation based upon a difference between the aggregate positive distance and the aggregate negative distance.
Abstract translation: 示例性方法，装置和系统接收用户可以在网络服务内与之交互的候选对象。 对于用户具有正交互作用的第一多个对象中的每一个，确定表示候选对象与第一多个对象中的每一个之间的共性的第一值。 对于用户具有负相互作用的第二多个对象中的每一个，确定表示候选对象与第二多个对象中的每一个之间的共性的第二值。 使用多个第一值来确定聚合的正距离。 使用多个第二值来确定聚合负距离。 基于聚合正距离和聚合负距离之间的差异，候选对象被显示或不显示给用户作为推荐。
-
公开(公告)号：US20150113060A1
公开(公告)日：2015-04-23
申请号：US14061516
申请日：2013-10-23
Applicant: Facebook, Inc.
Inventor： Ashish Wahi , Andrew Rothbart , Ming Hua , Rose Yao
IPC: H04L29/06
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: 在一个实施例中，一个或多个服务器计算设备从客户端计算设备接收对与图的第一节点相关联的第一信息的请求。 一个或多个服务器计算设备确定第一节点是否与节点簇相关联。 节点簇包括图形中彼此相关的一个或多个概念节点。 当第一节点与节点集群相关联时，一个或多个服务器计算设备访问第一节点相关联的节点集群，从节点簇中的一个或多个节点获得第二信息， 节点与由客户端计算设备呈现的第二信息相关联并提供第二信息。
-
公开(公告)号：US08788487B2
公开(公告)日：2014-07-22
申请号：US13690225
申请日：2012-11-30
Applicant: Facebook, Inc.
Inventor： Ryan Allen Stout , Ming Hua , Hong Yan
IPC: G06F17/30
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: 在线系统，例如，社交网络系统存储描述在线系统中表示的实体之间的关系的特征。 描述特征的信息表示为图形。 在线系统维护累积特征图和增量特征图。 基于最近用户动作的特征值存储在增量图中，基于先前动作的特征值存储在累积图中。 定期地，存储在增量特征图中的信息与存储在累积特征图中的信息合并。 增量图在合并期间被标记为不活动，而基于新用户操作的信息存储在活动增量特征图中。 如果接收到对特征信息的请求，则从累积特征图，非活动增量特征图和活动增量特征图获得的特征信息被组合以确定特征信息。
-
公开(公告)号：US20140156360A1
公开(公告)日：2014-06-05
申请号：US13690088
申请日：2012-11-30
Applicant: Facebook, Inc.
Inventor： Alon Michael Shalita , Ming Hua , Ryan Allen Stout
CPC classification number: G06Q50/01 , G06Q30/0255
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.
Abstract translation: 在线系统，例如，社交网络系统基于描述在线系统中表示的实体之间的关系的特征来评估表达。 这些表达式使用表达式语言表示。 表达式语言允许将功能指定为来自用户帐户的属性的函数。 表达式支持使用变量来表示计算，例如子表达式。 表达式是动态的，因为可以在呼叫时指定和执行表达式。 使用相同的表达式集多次，例如，为多个特征集（例如用户帐户）计算相同的功能。 表达式优选使用后缀表示来表示。 然而，一些表达式，例如，使用变量的表达式表示为树。 为了在运行时优化表达式，使用被确定为有效执行表达式的表示来缓存表达式。 表达式的缓存表示应用于多个功能集，例如用户帐户。
-
Patent Agency Ranking
公开(公告)号：US10360227B2
公开(公告)日：2019-07-23
申请号：US15222072
申请日：2016-07-28
Applicant: Facebook, Inc.
Inventor： Avichal Garg , Ming Hua , Michael S. Vernal , Yang Qin , Dan Ionut Fechete
IPC: G06F16/24 , G06F16/2457 , G06F16/35 , G06F16/248 , G06F16/28 , G06F16/332 , G06F16/335 , G06F16/901 , G06F16/9535 , 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 the communication system, an input from the first user to access a card-stack interface, generating a card cluster comprising a plurality of cards, each card comprising a suggested query referencing a query-domain and one or more query-filters, wherein each query-filter references one or more objects associated with the communication system, and wherein each card in the card cluster is ranked within the card cluster based on a predicted click-thru rate (CTR) for the card based on one or more user-engagement factors, 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 the card cluster, the cards of the card cluster being ordered based on the rankings associated with the cards.
-
公开(公告)号：US09690871B2
公开(公告)日：2017-06-27
申请号：US14722007
申请日：2015-05-26
Applicant: Facebook, Inc.
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.
-
公开(公告)号：US20160253334A1
公开(公告)日：2016-09-01
申请号：US15154261
申请日：2016-05-13
Applicant: Facebook, Inc.
Inventor： Dan Ionut Fechete , Ming Hua , Yang Qin
IPC: G06F17/30
CPC classification number: G06F16/24578 , G06F16/9535
Abstract: Exemplary methods, apparatuses, and systems receive a candidate object with which a user can interact within a network service. For each of a first plurality of objects with which the user has had a positive interaction, a first value representing a commonality between the candidate object and each of the first plurality of objects is determined. For each of a second plurality of objects with which a user has had a negative interaction, a second value representing a commonality between the candidate object and each of the second plurality of objects is determined. An aggregate positive distance is determined using a plurality of the first values. An aggregate negative distance is determined using a plurality of the second values. The candidate object is displayed or not displayed to the user as a recommendation based upon a difference between the aggregate positive distance and the aggregate negative distance.
-
公开(公告)号：US09367628B2
公开(公告)日：2016-06-14
申请号：US14147448
申请日：2014-01-03
Applicant: Facebook, Inc.
Inventor： Dan Ionut Fechete , Ming Hua , Yang Qin
IPC: G06F17/30
CPC classification number: G06F17/3053 , G06F17/30867
Abstract: Exemplary methods, apparatuses, and systems receive a candidate object with which a user can interact within a network service. For each of a first plurality of objects with which the user has had a positive interaction, a first value representing a commonality between the candidate object and each of the first plurality of objects is determined. For each of a second plurality of objects with which a user has had a negative interaction, a second value representing a commonality between the candidate object and each of the second plurality of objects is determined. An aggregate positive distance is determined using a plurality of the first values. An aggregate negative distance is determined using a plurality of the second values. The candidate object is displayed or not displayed to the user as a recommendation based upon a difference between the aggregate positive distance and the aggregate negative distance.
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
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: 在一个实施例中，一种方法包括从在线社交网络的用户的客户端设备接收来自用户的输入以访问卡堆栈接口，生成多个卡，其中每个卡包括引用一个 与在线社交网络相关联的查询域和一个或多个查询过滤器，并且其中每个查询过滤器引用在线社交网络的一个或多个对象，每个卡还包括与建议的查询相对应的一个或多个搜索结果，以及 每个搜索结果引用在线社交网络的对象匹配卡的建议查询; 以及响应于来自所述第一用户的输入，向所述客户端设备发送用于向所述第一用户显示的所述卡堆栈接口，其中所述卡堆栈接口包括所生成的卡中的一个或多个
-
-
-
-
-
-
-
-
-
Search Results
31
records
(took 0.019 seconds)
