公开(公告)号：US10409823B2

公开(公告)日：2019-09-10

申请号：US14983321

申请日：2015-12-29

Applicant: Facebook, Inc.

Inventor： Yang Qin ,  Zhong Zhang ,  Sergiu-Cosmin Ferentz ,  Dan Ionut Fechete

IPC: G06F16/2457 ,  G06F16/9535 ,  G06Q50/00

Abstract: In one embodiment, a method includes, in an online social network, accessing one or more first content objects associated with a user in the online social network and a second content object, determining topics and corresponding first weights of the topics for the first content objects using a topic extraction algorithm, where each first weight indicates a strength of an association between the corresponding topic and the first content object(s), determining one or more second weights of the topics for the second content object, where each second weight indicates a strength of an association between the corresponding topic and the second content object, and calculating a similarity score for the second content object based on a comparison of, for each topic, the first weight to the second weight, where the similarity score is to be used in a determination regarding presentation of the second content object to the user.

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

公开(公告)号：US20180013861A1

公开(公告)日：2018-01-11

申请号：US15207331

申请日：2016-07-11

Applicant: Facebook, Inc.

Inventor： Michael Andrew Howard ,  Jasper Reid Hauser ,  Scott Joseph Robert Horsfall ,  Vijay Sivakumar ,  Dan Ionut Fechete ,  Zhiyuan Zhang ,  Xuan Jiang ,  Xun Gong

IPC: H04L29/08 ,  G06F17/30

CPC classification number: H04L67/36 ,  G06F16/951 ,  G06Q10/101 ,  G06Q50/01 ,  H04L67/02 ,  H04L67/306

Abstract: In one embodiment, a method includes identifying one or more social network events that satisfy a query condition in a social-networking system, determining an event score for each of the identified events, where the event score is based on one or more signals that are each related to a first interaction between a target user and the social-networking system, and the first interaction associates the target user with the identified event, and presenting one or more of the identified events to the target user in an order based on the event score of each identified event. The interaction may establish an association between the target user and an entity associated with the event.

公开(公告)号：US20170034108A1

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

申请号：US14814382

申请日：2015-07-30

Applicant: Facebook, Inc.

Inventor： Dan Ionut Fechete ,  Jun Jiang ,  Yang Qin ,  Zhong Zhang

IPC: H04L12/58 ,  H04L29/08

CPC classification number: H04L51/32 ,  G06N5/022 ,  G06N20/00 ,  G06Q30/02 ,  H04L51/14 ,  H04L67/02 ,  H04L67/20 ,  H04L67/306

Abstract: In one embodiment, a method includes, by a computing device, identifying an event in an online social network to be evaluated for recommendation to a user of the online social network and determining whether the event is recommendable to the user, the determination being based on identifying correlations between one or more characteristics of the user and a plurality of signals associated with the event. The method further includes, in response to determining that the event is recommendable, presenting a recommendation or promotion for the event to the user, and, in response to determining that the event is not recommendable, converting the event in accordance with the determining that the event is not recommendable. The signals may include content associated with the event, metadata associated with the event, or responses to a notification about the event by users of the online social network.

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