专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20150193539A1 OBJECT RECOMMENDATION BASED UPON SIMILARITY DISTANCES 有权
标题翻译：基于相似距离的对象建议
公开(公告)号：US20150193539A1
公开(公告)日：2015-07-09
申请号：US14147448
申请日：2014-01-03
申请人： Facebook, Inc.
发明人： Dan Ionut Fechete , Ming Hua , Yang Qin
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30867
摘要： 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.
摘要翻译：示例性方法，装置和系统接收用户可以在网络服务内与之交互的候选对象。对于用户具有正交互作用的第一多个对象中的每一个，确定表示候选对象与第一多个对象中的每一个之间的共性的第一值。对于用户具有负相互作用的第二多个对象中的每一个，确定表示候选对象与第二多个对象中的每一个之间的共性的第二值。使用多个第一值来确定聚合的正距离。使用多个第二值来确定聚合负距离。基于聚合正距离和聚合负距离之间的差异，候选对象被显示或不显示给用户作为推荐。

2. 发明授权

US10841404B2 Events discovery context 有权
公开(公告)号：US10841404B2
公开(公告)日：2020-11-17
申请号：US15207331
申请日：2016-07-11
申请人： Facebook, Inc.
发明人： Michael Andrew Howard , Jasper Reid Hauser , Scott Joseph Robert Horsfall , Vijay Sivakumar , Dan Ionut Fechete , Zhiyuan Zhang , Xuan Jiang , Xun Gong
IPC分类号： H04L29/08 , G06F16/951 , G06Q10/10 , G06Q50/00
CPC分类号： H04L67/36 , G06F16/951 , G06Q10/101 , G06Q50/01 , H04L67/02 , H04L67/306
摘要： 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.

3. 发明申请

US20170185601A1 Identifying Content for Users on Online Social Networks 审中-公开
公开(公告)号：US20170185601A1
公开(公告)日：2017-06-29
申请号：US14983321
申请日：2015-12-29
申请人： Facebook, Inc.
发明人： Yang Qin , Zhong Zhang , Sergiu-Cosmin Ferentz , Dan Ionut Fechete
IPC分类号： G06F17/30
CPC分类号： G06F16/24578 , G06F16/9535 , G06N5/022 , G06N7/005 , G06Q50/01
摘要： 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.

4. 发明授权

US09460215B2 Ranking recommended search queries on online social networks 有权
标题翻译：排名在线社交网络上的推荐搜索查询
公开(公告)号：US09460215B2
公开(公告)日：2016-10-04
申请号：US14259001
申请日：2014-04-22
申请人： Facebook, Inc.
发明人： Avichal Garg , Ming Hua , Michael Vernal , Yang Qin , Dan Ionut Fechete
IPC分类号： G06F7/00 , G06F17/30 , H04L29/08 , H04L29/06 , G06Q50/00
CPC分类号： 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
摘要： 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.
摘要翻译：在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。两个节点之间的每个边缘表示它们之间的单一分离度。节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。该方法还包括生成包括多个卡的卡簇。每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询和零个或多个查询过滤器。每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。

5. 发明授权

US09959320B2 Generating card stacks with queries on online social networks 有权
公开(公告)号：US09959320B2
公开(公告)日：2018-05-01
申请号：US14568642
申请日：2014-12-12
申请人： Facebook, Inc.
发明人： 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 , H04L29/06 , G06Q50/00 , G06F3/0482 , G06F3/0484
CPC分类号： 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
摘要： 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.

6. 发明申请

US20180013818A1 Events Discovery Interface 审中-公开
公开(公告)号：US20180013818A1
公开(公告)日：2018-01-11
申请号：US15207342
申请日：2016-07-11
申请人： Facebook, Inc.
发明人： Michael Andrew Howard , Jasper Reid Hauser , Scott Joseph Robert Horsfall , Vijay Sivakumar , Dan Ionut Fechete , Zhiyuan Zhang , Xuan Jiang , Xun Gong
IPC分类号： H04L29/08
CPC分类号： H04L67/18 , G06Q50/01 , H04L67/22 , H04L67/306 , H04W4/023
摘要： In one embodiment, a method includes identifying one or more event categories that are of interest to a user of a social-networking system, where each of the event categories comprises one or more social-networking events. generating an event category interface element that represents the event category, where the event category interface element comprises category content that is based on historical information associated with the user, and presenting the event category interface elements to the user. The category content may be based on at least one of the one or more social-networking events in the event category. The category content may be based on a highest-ranking event in the event category. The category content may be based on an image of the highest-ranking event in the event category.

7. 发明申请

US20150178284A1 Ranking Recommended Search Queries on Online Social Networks 有权
标题翻译：排名推荐搜索在线社交网络的查询
公开(公告)号：US20150178284A1
公开(公告)日：2015-06-25
申请号：US14259001
申请日：2014-04-22
申请人： Facebook, Inc.
发明人： Avichal Garg , Ming Hua , Michael Vernal , Yang Qin , Dan Ionut Fechete
IPC分类号： G06F17/30 , H04L29/08
CPC分类号： 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
摘要： 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.
摘要翻译：在一个实施例中，一种方法包括访问包括连接节点的多个节点和边缘的社交图。两个节点之间的每个边缘表示它们之间的单一分离度。节点包括对应于与在线社交网络相关联的第一用户的第一节点和每个对应于与在线社交网络相关联的概念或第二用户的多个第二节点。该方法还包括生成包括多个卡的卡簇。每个卡片包括一个引用与在线社交网络相关联的查询域的建议查询和零个或多个查询过滤器。每个查询过滤器引用多个节点中的一个或多个节点或多个边缘中的一个或多个边缘。

8. 发明授权

US10360227B2 Ranking recommended search queries 有权
公开(公告)号：US10360227B2
公开(公告)日：2019-07-23
申请号：US15222072
申请日：2016-07-28
申请人： Facebook, Inc.
发明人： 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
摘要： 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.

9. 发明申请

US20160253334A1 OBJECT RECOMMENDATION BASED UPON SIMILARITY DISTANCES 审中-公开
公开(公告)号：US20160253334A1
公开(公告)日：2016-09-01
申请号：US15154261
申请日：2016-05-13
申请人： Facebook, Inc.
发明人： Dan Ionut Fechete , Ming Hua , Yang Qin
IPC分类号： G06F17/30
CPC分类号： G06F16/24578 , G06F16/9535
摘要： 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.

10. 发明授权

US09367628B2 Object recommendation based upon similarity distances 有权
标题翻译：基于相似距离的对象推荐
公开(公告)号：US09367628B2
公开(公告)日：2016-06-14
申请号：US14147448
申请日：2014-01-03
申请人： Facebook, Inc.
发明人： Dan Ionut Fechete , Ming Hua , Yang Qin
IPC分类号： G06F17/30
CPC分类号： G06F17/3053 , G06F17/30867
摘要： 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.
摘要翻译：示例性方法，装置和系统接收用户可以在网络服务内与之交互的候选对象。对于用户具有正交互作用的第一多个对象中的每一个，确定表示候选对象与第一多个对象中的每一个之间的共性的第一值。对于用户具有负相互作用的第二多个对象中的每一个，确定表示候选对象与第二多个对象中的每一个之间的共性的第二值。使用多个第一值来确定聚合的正距离。使用多个第二值来确定聚合负距离。基于聚合正距离和聚合负距离之间的差异，候选对象被显示或不显示给用户作为推荐。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式