公开(公告)号：US10795936B2

公开(公告)日：2020-10-06

申请号：US14935324

申请日：2015-11-06

Applicant: Facebook, Inc.

Inventor： Jan Kalis ,  Justin Moore ,  Long Chen

IPC: G06F17/00 ,  G06F7/00 ,  G06F16/901 ,  H04L29/08 ,  H04L12/58 ,  H04W4/21 ,  G06Q50/00 ,  H04W4/02

Abstract: In one embodiment, a method includes receiving, by one or more computing devices of an online social network, from a client system of a first user of the online social network, a query inputted by the first user. The method further includes accessing a social graph of the online social network, the social graph including multiple nodes and multiple edges connecting the nodes, each node corresponding to an entity associated with the online social network. The method also includes identifying multiple entities matching the query, each identified entity having a duplication-value with respect to a canonical-entity, the duplication-values being based on a name similarity between the identified entity and the canonical-entity. The method also includes suppressing one or more entities of the identified entities based on the duplication-value of the entity and social-graph information associated with the entity.

公开(公告)号：US20170132226A1

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

申请号：US14935324

申请日：2015-11-06

Applicant: Facebook, Inc.

Inventor： Jan Kalis ,  Justin Moore ,  Long Chen

IPC: G06F17/30 ,  H04L12/58 ,  H04L29/08

CPC classification number: G06F16/9024 ,  G06Q50/01 ,  H04L51/32 ,  H04L67/18 ,  H04W4/023 ,  H04W4/21

Abstract: In one embodiment, a method includes receiving, by one or more computing devices of an online social network, from a client system of a first user of the online social network, a query inputted by the first user. The method further includes accessing a social graph of the online social network, the social graph including multiple nodes and multiple edges connecting the nodes, each node corresponding to an entity associated with the online social network. The method also includes identifying multiple entities matching the query, each identified entity having a duplication-value with respect to a canonical-entity, the duplication-values being based on a name similarity between the identified entity and the canonical-entity. The method also includes suppressing one or more entities of the identified entities based on the duplication-value of the entity and social-graph information associated with the entity.

公开(公告)号：US10853335B2

公开(公告)日：2020-12-01

申请号：US15192780

申请日：2016-06-24

Applicant: Facebook, Inc.

Inventor： Justin Moore ,  Marian Gelu Olteanu ,  Myle Arif Ott ,  Long Chen ,  Ivan Medvedev

IPC: G06F16/215 ,  H04L12/58 ,  G06F16/29 ,  G06F16/28 ,  G06F16/951 ,  G06F16/901 ,  H04L29/08 ,  H04W4/80 ,  H04W4/02 ,  G06Q50/00 ,  H04W4/029

Abstract: In one embodiment, an online social network accesses a place-entity cluster comprising a number of place-entity nodes corresponding to a particular place-entity having a geographic location. One of the place-entity nodes is identified as an initial canonical place-entity cluster connected to the other place-entity nodes by redirection edges. A cluster score is calculated for each place-entity node in the cluster, and nodes having a cluster score above a threshold is identified. One of the identified place-entity nodes is selected as a replacement canonical place-entity node. If the replacement node is different from the initial canonical node, then the place-entity cluster is updated by adding or removing at least one place-entity node from the cluster based on their respective cluster scores.

公开(公告)号：US20170199927A1

公开(公告)日：2017-07-13

申请号：US15192780

申请日：2016-06-24

Applicant: Facebook, Inc.

Inventor： Justin Moore ,  Marian Gelu Olteanu ,  Myle Arif Ott ,  Long Chen ,  Ivan Medvedev

IPC: G06F17/30

CPC classification number: G06F16/215 ,  G06F16/285 ,  G06F16/29 ,  G06F16/9024 ,  G06F16/951 ,  G06Q50/01 ,  H04L51/20 ,  H04L51/32 ,  H04L67/02 ,  H04L67/2814 ,  H04L67/306 ,  H04W4/02 ,  H04W4/029 ,  H04W4/80

Abstract: In one embodiment, an online social network accesses a place-entity cluster comprising a number of place-entity nodes corresponding to a particular place-entity having a geographic location. One of the place-entity nodes is identified as an initial canonical place-entity cluster connected to the other place-entity nodes by redirection edges. A cluster score is calculated for each place-entity node in the cluster, and nodes having a cluster score above a threshold is identified. One of the identified place-entity nodes is selected as a replacement canonical place-entity node. If the replacement node is different from the initial canonical node, then the place-entity cluster is updated by adding or removing at least one place-entity node from the cluster based on their respective cluster scores.