公开(公告)号：US20150100591A1

公开(公告)日：2015-04-09

申请号：US14569602

申请日：2014-12-12

Applicant: Facebook, Inc.

Inventor： Robert William Cathcart ,  Rafael Linden Sagula ,  Cameron Alexander Marlow ,  Jonathan Chang ,  Siddharth Kar ,  Eric Sun

IPC: G06F17/30

CPC classification number: G06F17/30861 ,  G06Q10/10

Abstract: Equivalent concepts expressed across multiple domains are matched and associated with a metapage generated by a social networking system. User preferences expressed on multiple domains, represented as pages in a social networking system, may be organized by concept and shared with advertisers, third-party developers, and other users of the social networking system using the metapages generated for the concepts. Aggregated social information may be presented to users of the social networking system viewing a page associated with a metapage. Information presented on external websites may be used to link pages across multiple domains with a metapage generated on the social networking system. In one embodiment, the information on other external websites associated with the metapage may be presented as links on the pages associated with the metapage. Feedback from users may be used to include or exclude pages from being associated with a generated metapage. In one embodiment, a best page may be determined for a concept embodied in multiple pages on the social networking system using a hierarchy of rules. In another embodiment, a best page may be determined for a user based on information about the user. In yet another embodiment, social context information may be provided on a page associated with a metapage for a viewing user that shows expressions of interest by other users on the page and other pages associated with the metapage.

Abstract translation: 在多个域中表达的等效概念与由社交网络系统生成的元页匹配并相关联。 在社交网络系统中表示为多个域的用户偏好可以按照概念进行组织，并使用为概念生成的元标记与广告商，第三方开发人员和社交网络系统的其他用户共享。 可以向社交网络系统的用户呈现聚集的社交信息，该用户查看与元页面相关联的页面。 在外部网站上呈现的信息可用于通过社交网络系统上生成的元页面在多个域中链接页面。 在一个实施例中，与元页相关联的其他外部网站上的信息可以作为与元页面相关联的页面上的链接来呈现。 来自用户的反馈可以用于包括或排除页面与生成的元标记相关联。 在一个实施例中，可以使用规则层级来确定体现在社交网络系统上的多个页面中的概念的最佳页面。 在另一个实施例中，可以基于关于用户的信息为用户确定最佳页面。 在另一个实施例中，社交上下文信息可以提供在与用于显示页面上的其他用户感兴趣的表示的查看用户的元页面相关联的页面上，并且与元页面相关联的其他页面。

公开(公告)号：US20170124467A1

公开(公告)日：2017-05-04

申请号：US15375050

申请日：2016-12-09

Applicant: Facebook, Inc.

Inventor： Deepayan Chakrabarti ,  Sofus Attila Macskassy ,  Stanislav Funiak ,  Jonathan Chang

IPC: G06N5/04 ,  G06Q50/00

CPC classification number: G06N5/04 ,  G06F16/9535 ,  G06N7/005 ,  G06Q50/01

Abstract: At least one embodiment of this disclosure includes a method of inferring attribute labels for a user in a social networking system based on the user's social connections and user-specified attribute labels in the social networking system. The method can include: establishing variational equations based on attribute labels of nodes in an ego network in a social graph of a social networking system; determining likelihood scores for at least a portion of the attribute labels of neighboring nodes from a focal user node in the ego network based on user-specified attribute labels from the social networking system; and calculating probability distributions of possible attribute labels for the focal user node of the ego network based on the variational equations and the likelihood scores.

公开(公告)号：US20160019313A1

公开(公告)日：2016-01-21

申请号：US14336363

申请日：2014-07-21

Applicant: Facebook, Inc.

Inventor： Deepayan Chakrabarti ,  Jonathan Chang ,  Avery Li Kuang Ching ,  Maja Kabiljo

IPC: G06F17/30 ,  H04L29/06 ,  H04L12/26 ,  H04L12/911

CPC classification number: G06F17/30958 ,  G06F17/30336 ,  G06F17/30377 ,  G06Q50/01 ,  H04L47/70 ,  H04L65/403 ,  H04L67/1097

Abstract: Embodiments are disclosed for striping a directed graph, e.g., a social graph, so as to efficiently perform an operation to each node in the directed graph. At least some of the embodiments can select first and second sets of nodes from the directed graph to form first and second stripes. The first and second sets of nodes are selected, for example, based on available computing resources. First and second intermediate results can be generated by performing the operation to each node of the first and the second stripes, respectively. The operation iteratively performs a superstep. The first and the second intermediate results are combined to form a collective result as an output of the superstep.

Abstract translation: 公开了用于条带化有向图（例如，社交图）的实施例，以有效地对有向图中的每个节点执行操作。 至少一些实施例可以从有向图中选择第一和第二组节点以形成第一和第二条带。 例如，基于可用的计算资源来选择第一和第二组节点。 可以通过分别对第一和第二条纹的每个节点执行操作来生成第一和第二中间结果。 该操作迭代地执行一个超级步骤。 第一和第二中间结果被组合以形成作为超级步骤的输出的集合结果。

公开(公告)号：US20160335277A1

公开(公告)日：2016-11-17

申请号：US15219048

申请日：2016-07-25

Applicant: Facebook, Inc.

Inventor： Yuntao Jia ,  Mukund Narasimhan ,  Jonathan Chang ,  Joshua Redstone

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

Abstract: In one embodiment, a computing device accesses a social graph comprising nodes and edges connecting the nodes. Each of the edges between two of the nodes represents a single degree of separation between them. The nodes include user nodes corresponding to users of an online social network, and concept nodes corresponding to places. A particular place corresponds to a particular concept node, and corresponds to an associated location and a perimeter. A number of check-ins are received, each check-in being associated with the particular place and having a geographic location. Each check-in corresponds to an edge of the social graph between a user node and the particular concept node. Based on the received check-ins the computing device determines whether to update the associated location and the perimeter.

Abstract translation: 在一个实施例中，计算设备访问包括连接节点的节点和边缘的社交图。 两个节点之间的每个边缘表示它们之间的单一分离度。 节点包括对应于在线社交网络的用户的用户节点和对应于场所的概念节点。 特定的位置对应于特定概念节点，并且对应于相关联的位置和周界。 接收到多个签到，每个签到与特定地点相关联并具有地理位置。 每个签到对应于用户节点和特定概念节点之间的社交图的边缘。 基于所接收的签入，计算设备确定是否更新相关联的位置和周边。

公开(公告)号：US20150213370A1

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

申请号：US14272176

申请日：2014-05-07

Applicant: Facebook, Inc.

Inventor： Deepayan Chakrabarti ,  Sofus Attila Macskassy ,  Stanislav Funiak ,  Jonathan Chang

IPC: G06N5/04 ,  G06Q50/00 ,  G06N7/00

CPC classification number: G06N5/04 ,  G06F17/30867 ,  G06N7/005 ,  G06Q50/01

Abstract: At least one embodiment of this disclosure includes a method of inferring attribute labels for a user in a social networking system based on the user's social connections and user-specified attribute labels in the social networking system. The method can include: establishing variational equations based on attribute labels of nodes in an ego network in a social graph of a social networking system; determining likelihood scores for at least a portion of the attribute labels of neighboring nodes from a focal user node in the ego network based on user-specified attribute labels from the social networking system; and calculating probability distributions of possible attribute labels for the focal user node of the ego network based on the variational equations and the likelihood scores.

Abstract translation: 本公开的至少一个实施例包括一种在社交网络系统中基于用户的社交连接和用户指定的社交网络系统中的属性标签推断用户的属性标签的方法。 该方法可以包括：基于社交网络系统的社交图中的自我网络中的节点的属性标签来建立变分方程; 基于来自所述社交网络系统的用户指定的属性标签，确定所述自我网络中的焦点用户节点的至少一部分相邻节点的属性标签的可能性得分; 并且基于变分方程和似然分数来计算自我网络的焦点用户节点的可能属性标签的概率分布。