中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

14 records (took 0.018 seconds)

    Identifying Content for Users on Online Social Networks
    1.
    发明申请
    Identifying Content for Users on Online Social Networks 审中-公开

    公开(公告)号：US20170185601A1

    公开(公告)日：2017-06-29

    申请号：US14983321

    申请日：2015-12-29

    Applicant: Facebook, Inc.

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

    IPC: G06F17/30

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

    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.

    Ranking recommended search queries on online social networks
    2.
    发明授权
    Ranking recommended search queries on online social networks 有权
    排名在线社交网络上的推荐搜索查询

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

    Ranking Recommended Search Queries
    3.
    发明申请
    Ranking Recommended Search Queries 审中-公开
    排名推荐搜索查询

    公开(公告)号：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），并且响应于来自第一用户的输入向客户端系统发送用于向第一用户显示的卡堆栈接口，其中， 卡堆栈接口包括卡簇，基于与卡相关联的排名来订购卡簇的卡。

    OBJECT RECOMMENDATION BASED UPON SIMILARITY DISTANCES
    4.
    发明申请
    OBJECT RECOMMENDATION BASED UPON SIMILARITY DISTANCES 有权
    基于相似距离的对象建议

    公开(公告)号：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: 示例性方法，装置和系统接收用户可以在网络服务内与之交互的候选对象。 对于用户具有正交互作用的第一多个对象中的每一个，确定表示候选对象与第一多个对象中的每一个之间的共性的第一值。 对于用户具有负相互作用的第二多个对象中的每一个，确定表示候选对象与第二多个对象中的每一个之间的共性的第二值。 使用多个第一值来确定聚合的正距离。 使用多个第二值来确定聚合负距离。 基于聚合正距离和聚合负距离之间的差异，候选对象被显示或不显示给用户作为推荐。

    Ranking Recommended Search Queries on Online Social Networks
    6.
    发明申请
    Ranking Recommended Search Queries on Online Social Networks 有权
    排名推荐搜索在线社交网络的查询

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

    Identifying content for users on online social networks
    7.
    发明授权
    Identifying content for users on online social networks 有权

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

    DETERMINING EVENT RECOMMENDABILITY IN ONLINE SOCIAL NETWORKS
    9.
    发明申请
    DETERMINING EVENT RECOMMENDABILITY IN ONLINE SOCIAL NETWORKS 审中-公开
    确定在线社交网络中的事件推荐性

    公开(公告)号：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: 在一个实施例中，一种方法包括通过计算设备识别要在线社交网络中被评估以推荐给在线社交网络的用户的事件并且确定该事件是否对用户可推荐的，所述确定基于 识别用户的一个或多个特征与与该事件相关联的多个信号之间的相关性。 所述方法还包括响应于确定所述事件是可推荐的，向所述用户呈现所述事件的推荐或促销，并且响应于确定所述事件不可推荐，根据确定所述事件 事件不推荐 信号可以包括与事件相关联的内容，与事件相关联的元数据，或者对在线社交网络的用户对关于事件的通知的响应。

Patent Agency Ranking