-
公开(公告)号：US20170116200A1
公开(公告)日：2017-04-27
申请号：US15400083
申请日：2017-01-06
Applicant: Yahoo! Inc.
Inventor： Pavel Berkhim , Zhichen Xu , Jianchang Mao , Daniel E. Rose , Abe Taha , Farzin Maghoul
IPC: G06F17/30
CPC classification number: G06F16/24578 , G06F16/313 , G06F16/9535 , Y10S707/99932 , Y10S707/99933
Abstract: The present invention is directed towards systems and methods for trust propagation. The method according to one embodiment comprises calculating a first feature vector for a first user, calculating a second feature for a second user and comparing the first feature vector with the second feature vector to calculate a similarity value. A determination is made as to whether the similarity value falls within a threshold. If the similarity value falls within the threshold, a relationship is recorded between the first user and the second user in a first user profile and a second user profile.
-
2.发明申请Search system and methods with integration of user annotations from a trust network 有权搜索系统和方法，集成了来自信任网络的用户注释公开(公告)号：US20140289232A1
公开(公告)日：2014-09-25
申请号：US14292028
申请日：2014-05-30
Applicant: Yahoo! Inc.
Inventor： Qi Lu , Eckart Walther , David Ku , Chung-Man Tam , Kevin Lee , Zhichen Xu , Ali Diab , Kenneth Norton , Jianchang Mao
IPC: G06F17/30
CPC classification number: G06F17/30525 , G06F17/30867 , G06F17/30899 , H04L51/32
Abstract: Computer systems and methods incorporate user annotations (metadata) regarding various pages or sites, including annotations by a querying user and by members of a trust network defined for the querying user into search and browsing of a corpus such as the World Wide Web. A trust network is defined for each user, and annotations by any member of a first user's trust network are made visible to the first user during search and/or browsing of the corpus. Users can also limit searches to content annotated by members of their trust networks or by members of a community selected by the user.
Abstract translation: 计算机系统和方法包括关于各种页面或站点的用户注释（元数据），包括查询用户的注释以及为查询用户定义的用于搜索和浏览诸如万维网的语料库的信任网络的成员。 为每个用户定义信任网络，并且在搜索和/或浏览语料库期间使第一用户的信任网络的任何成员的注释对于第一用户可见。 用户还可以将搜索限制在其信任网络的成员注释的内容或由用户选择的社区的成员。
-
3.发明申请公开(公告)号：US20130226918A1
公开(公告)日：2013-08-29
申请号：US13859208
申请日：2013-04-09
Applicant: Yahoo! Inc.
Inventor： Pavel Berkhim , Zhichen Xu , Jianchang Mao , Daniel E. Rose , Abe Taha , Farzin Maghoul
IPC: G06F17/30
CPC classification number: G06F17/3053 , G06F17/30616 , G06F17/30867 , Y10S707/99932 , Y10S707/99933
Abstract: The present invention is directed towards systems and methods for trust propagation. The method according to one embodiment comprises calculating a first feature vector for a first user, calculating a second feature for a second user and comparing the first feature vector with the second feature vector to calculate a similarity value. A determination is made as to whether the similarity value falls within a threshold. If the similarity value falls within the threshold, a relationship is recorded between the first user and the second user in a first user profile and a second user profile.
Abstract translation: 本发明涉及用于信任传播的系统和方法。 根据一个实施例的方法包括计算第一用户的第一特征向量，计算第二用户的第二特征并将第一特征向量与第二特征向量进行比较以计算相似度值。 确定相似度值是否在阈值内。 如果相似度值落在阈值内，则在第一用户简档和第二用户简档中记录第一用户和第二用户之间的关系。
-
公开(公告)号：US09137329B2
公开(公告)日：2015-09-15
申请号：US14157867
申请日：2014-01-17
Applicant: YAHOO! INC.
Inventor： Zhichen Xu
CPC classification number: H04L67/32 , G06F12/0868 , G06F2015/765 , G06Q50/01 , H04L67/26 , H04L67/2842 , H04L67/306 , H04L67/325
Abstract: Embodiments are directed towards modifying a distribution of writers as either a push writer or a pull writer based on a cost model that decides for a given content reader whether it is more effective for the writer to be a pull writer or a push writer. A cache is maintained for each content reader for caching content items pushed by a push writer in the content writer's push list of writers when the content is generated. At query time, content items are pulled by the content reader based on writers a content reader's pull list. One embodiment of the cost model employs data about a previous number of requests for content items for a given writer for a number of previous blended display results of content items. When a writer is determined to be popular, mechanisms are proposed for pushing content items to a plurality of content readers.
Abstract translation: 实施例旨在基于决定给定内容读取器的成本模型来将作者的分布修改为推送写入器或拉写入器，以使作者是更有效的作为拉写入器还是推动写入器。 为每个内容读取器维护高速缓存，用于在生成内容时缓存内容写入者的推送列表中的推送写入器推送的内容项目。 在查询时，内容读取器根据写入者提取内容读取器的列表。 成本模型的一个实施例使用关于给定写入器的先前数量的内容项的请求的数据用于多个内容项的先前混合显示结果。 当作者被确定为流行时，提出将内容项推送到多个内容阅读器的机制。
-
Patent Agency Ranking
公开(公告)号：US09852187B2
公开(公告)日：2017-12-26
申请号：US14292028
申请日：2014-05-30
Applicant: Yahoo! Inc.
Inventor： Qi Lu , Eckart Walther , David Ku , Chung-Man Tam , Kevin Lee , Zhichen Xu , Ali Diab , Kenneth Norton , Jianchang Mao
CPC classification number: G06F17/30525 , G06F17/30867 , G06F17/30899 , H04L51/32
Abstract: Computer systems and methods incorporate user annotations (metadata) regarding various pages or sites, including annotations by a querying user and by members of a trust network defined for the querying user into search and browsing of a corpus such as the World Wide Web. A trust network is defined for each user, and annotations by any member of a first user's trust network are made visible to the first user during search and/or browsing of the corpus. Users can also limit searches to content annotated by members of their trust networks or by members of a community selected by the user.
-
公开(公告)号：US09576029B2
公开(公告)日：2017-02-21
申请号：US13859208
申请日：2013-04-09
Applicant: YAHOO! INC.
Inventor： Pavel Berkhim , Zhichen Xu , Jianchang Mao , Daniel E. Rose , Abe Taha , Farzin Maghoul
CPC classification number: G06F17/3053 , G06F17/30616 , G06F17/30867 , Y10S707/99932 , Y10S707/99933
Abstract: The present invention is directed towards systems and methods for trust propagation. The method according to one embodiment comprises calculating a first feature vector for a first user, calculating a second feature for a second user and comparing the first feature vector with the second feature vector to calculate a similarity value. A determination is made as to whether the similarity value falls within a threshold. If the similarity value falls within the threshold, a relationship is recorded between the first user and the second user in a first user profile and a second user profile.
Abstract translation: 本发明涉及用于信任传播的系统和方法。 根据一个实施例的方法包括计算第一用户的第一特征向量，计算第二用户的第二特征并将第一特征向量与第二特征向量进行比较以计算相似度值。 确定相似度值是否在阈值内。 如果相似度值落在阈值内，则在第一用户简档和第二用户简档中记录第一用户和第二用户之间的关系。
-
公开(公告)号：US09015170B2
公开(公告)日：2015-04-21
申请号：US14019931
申请日：2013-09-06
Applicant: Yahoo! Inc.
Inventor： Zhichen Xu , Aurora Skarra-Gallagher , Neal Sample , Yun Fu
CPC classification number: G06F17/3053 , G06F17/30979 , G06Q10/10 , G06Q30/02 , G06Q50/01
Abstract: Techniques are provided for selecting a diverse mix of content items that may be displayed to a user. Content items such as user-generated events are received from a variety of sources. One or more content items are added to a set of content items based on a diversity of characteristics. The diversity of characteristics for the one or more content items may be calculated by measuring a diversity of characteristics of the set as if the one or more content items were added to the set. Content items that produce a greater diversity are selected for addition to the set. The set is displayed to the user, who is provided with a more meaningful mix of content due to the greater diversity in content.
Abstract translation: 提供了用于选择可以向用户显示的内容项目的不同组合的技术。 从各种来源接收诸如用户生成的事件的内容项目。 基于特征的多样性将一个或多个内容项目添加到一组内容项目中。 可以通过测量集合的特征的多样性来计算一个或多个内容项目的特征的多样性，就好像一个或多个内容项目被添加到组中一样。 选择产生更大分集度的内容项，以添加到集合中。 该集合向用户显示，由于内容的多样性，谁被提供了更有意义的内容组合。
-
公开(公告)号：US09576057B2
公开(公告)日：2017-02-21
申请号：US13732535
申请日：2013-01-02
Applicant: Yahoo! Inc.
Inventor： Kenneth Norton , Chung-Man Tam , Jianchang Mao , Zhichen Xu , Adrienne Bassett , Ashley Hall , Nathan Arnold
IPC: G06F7/04 , G06F17/30 , G06F3/0484
CPC classification number: G06F17/30867 , G06F3/04842 , G06F17/30873 , G06F17/30997
Abstract: The present invention relates to systems, methods, and user interfaces for browsing a collection of content items saved by a user or by one or more buddies associated with a given user. The method of the present invention comprises saving one or more content items and one or more associated keywords as specified by a user. An interface is generated that displays the one or more saved content items and the one or more associated keywords, as well as the one or more buddies associated with a given user. A user indication of the selection of a given keyword or the selection of a given buddy by the user is received. The one or more displayed content items are filtered according to the selected keyword, buddy, or combination of selected keyword and buddy.
Abstract translation: 本发明涉及用于浏览由用户或由与给定用户相关联的一个或多个伙伴保存的内容项目的集合的系统，方法和用户界面。 本发明的方法包括保存由用户指定的一个或多个内容项和一个或多个关联关键字。 生成一个界面，显示一个或多个保存的内容项目以及一个或多个关联关键字，以及与给定用户相关联的一个或多个伙伴。 接收给定关键字的选择的用户指示或用户对给定好友的选择。 一个或多个显示的内容项目根据所选择的关键字，好友或所选关键词和伙伴的组合进行过滤。
-
公开(公告)号：US20140136595A1
公开(公告)日：2014-05-15
申请号：US14157867
申请日：2014-01-17
Applicant: YAHOO! INC.
Inventor： Zhichen Xu
IPC: H04L29/08
CPC classification number: H04L67/32 , G06F12/0868 , G06F2015/765 , G06Q50/01 , H04L67/26 , H04L67/2842 , H04L67/306 , H04L67/325
Abstract: Embodiments are directed towards modifying a distribution of writers as either a push writer or a pull writer based on a cost model that decides for a given content reader whether it is more effective for the writer to be a pull writer or a push writer. A cache is maintained for each content reader for caching content items pushed by a push writer in the content writer's push list of writers when the content is generated. At query time, content items are pulled by the content reader based on writers a content reader's pull list. One embodiment of the cost model employs data about a previous number of requests for content items for a given writer for a number of previous blended display results of content items. When a writer is determined to be popular, mechanisms are proposed for pushing content items to a plurality of content readers.
Abstract translation: 实施例旨在基于决定给定内容读取器的成本模型来将作者的分布修改为推送写入器或拉写入器，以使作者是更有效的作为拉写入器还是推动写入器。 为每个内容读取器维护高速缓存，用于在生成内容时缓存内容写入者的推送列表中的推送写入器推送的内容项目。 在查询时，内容读取器根据写入者提取内容读取器的列表。 成本模型的一个实施例使用关于给定写入器的先前数量的内容项的请求的数据用于多个内容项的先前混合显示结果。 当作者被确定为流行时，提出将内容项推送到多个内容阅读器的机制。
-
-
-
-
-
-
-
-
Search Results
9
records
(took 0.02 seconds)
