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

1. 发明申请

US20110029517A1 GLOBAL AND TOPICAL RANKING OF SEARCH RESULTS USING USER CLICKS 审中-公开
标题翻译：使用用户点击搜索结果的全球和主题排名
公开(公告)号：US20110029517A1
公开(公告)日：2011-02-03
申请号：US12533564
申请日：2009-07-31
申请人： Shihao Ji , Anlei Dong , Ciya Liao , Yi Chang , Zhaohui Zheng , Olivier Chapelle , Gordon Guo-Zheng Sun , Hongyuan Zha
发明人： Shihao Ji , Anlei Dong , Ciya Liao , Yi Chang , Zhaohui Zheng , Olivier Chapelle , Gordon Guo-Zheng Sun , Hongyuan Zha
IPC分类号： G06F17/30
CPC分类号： G06F16/951
摘要： To estimate, or predict, the relevance of items, or documents, in a set of search results, relevance information is extracted from user click data, and relational information among the documents as manifested by an aggregation of user clicks is determined from the click data. A supervised approach uses judgment information, such as human judgment information, as part of the training data used to generate a relevance predictor model, which minimizes the inherent noisiness of the click data collected from a commercial search engine.
摘要翻译：为了在一组搜索结果中估计或预测项目或文档的相关性，从用户点击数据中提取相关性信息，并且从点击数据确定由用户点击的聚合表现的文档之间的关系信息。受监督的方法使用诸如人类判断信息之类的判断信息作为用于生成相关性预测器模型的训练数据的一部分，其使从商业搜索引擎收集的点击数据的固有噪声最小化。

2. 发明申请

US20110093459A1 Incorporating Recency in Network Search Using Machine Learning 有权
标题翻译：使用机器学习在网络搜索中结合新近度
公开(公告)号：US20110093459A1
公开(公告)日：2011-04-21
申请号：US12579855
申请日：2009-10-15
申请人： Anlei Dong , Yi Chang , Ruiqiang Zhang , Zhaohui Zheng , Gilad Avraham Mishne , Jing Bai , Karolina Barbara Buchner , Ciya Liao , Shihao Ji , Gilbert Leung , Georges-Eric Albert Marie Robert Dupret , Ling Liu
发明人： Anlei Dong , Yi Chang , Ruiqiang Zhang , Zhaohui Zheng , Gilad Avraham Mishne , Jing Bai , Karolina Barbara Buchner , Ciya Liao , Shihao Ji , Gilbert Leung , Georges-Eric Albert Marie Robert Dupret , Ling Liu
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： In one embodiment, access a set of recency ranking data comprising one or more recency search queries and one or more recency search results, each of the recency search queries being recency-sensitive with respect to a particular time period and being associated with a query timestamp representing the time at which the recency search query is received at a search engine, each of the recency search results being generated by the search engine for one of the recency search queries and comprising one or more recency network resources. Construct a plurality of recency features from the set of recency ranking data. Train a first ranking model via machine learning using at least the recency features.
摘要翻译：在一个实施例中，访问包括一个或多个新近度搜索查询和一个或多个新近度搜索结果的一组新近度排序数据，每个新近度搜索查询相对于特定时间段是新近敏感度，并且与查询时间戳相关联表示在搜索引擎处接收到新近度搜索查询的时间，每个新近度搜索结果由搜索引擎为新近搜索查询之一生成，并且包括一个或多个新近网络资源。从新近度排序数据集合构建多个新近特征。通过机器学习，至少使用新特性来训练第一个排名榜。

3. 发明授权

US08886641B2 Incorporating recency in network search using machine learning 有权
标题翻译：使用机器学习将新近度纳入网络搜索
公开(公告)号：US08886641B2
公开(公告)日：2014-11-11
申请号：US12579855
申请日：2009-10-15
申请人： Anlei Dong , Yi Chang , Ruiqiang Zhang , Zhaohui Zheng , Gilad Avraham Mishne , Jing Bai , Karolina Barbara Buchner , Ciya Liao , Shihao Ji , Gilbert Leung , Georges-Eric Albert Marie Robert Dupret , Ling Liu
发明人： Anlei Dong , Yi Chang , Ruiqiang Zhang , Zhaohui Zheng , Gilad Avraham Mishne , Jing Bai , Karolina Barbara Buchner , Ciya Liao , Shihao Ji , Gilbert Leung , Georges-Eric Albert Marie Robert Dupret , Ling Liu
IPC分类号： G06F17/30
CPC分类号： G06F17/30867
摘要： In one embodiment, access a set of recency ranking data comprising one or more recency search queries and one or more recency search results, each of the recency search queries being recency-sensitive with respect to a particular time period and being associated with a query timestamp representing the time at which the recency search query is received at a search engine, each of the recency search results being generated by the search engine for one of the recency search queries and comprising one or more recency network resources. Construct a plurality of recency features from the set of recency ranking data. Train a first ranking model via machine learning using at least the recency features.
摘要翻译：在一个实施例中，访问包括一个或多个新近度搜索查询和一个或多个新近度搜索结果的一组新近度排序数据，每个新近度搜索查询相对于特定时间段是新近敏感度，并且与查询时间戳相关联表示在搜索引擎处接收到新近度搜索查询的时间，每个新近度搜索结果由搜索引擎为新近搜索查询之一生成，并且包括一个或多个新近网络资源。从新近度排序数据集合构建多个新近特征。通过机器学习，至少使用新特性来训练第一个排名榜。

4. 发明申请

US20110231390A1 SESSION BASED CLICK FEATURES FOR RECENCY RANKING 有权
标题翻译：基于会话的点击功能
公开(公告)号：US20110231390A1
公开(公告)日：2011-09-22
申请号：US12725310
申请日：2010-03-16
申请人： Yoshiyuki Inagaki , Narayanan Sadagopan , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
发明人： Yoshiyuki Inagaki , Narayanan Sadagopan , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
IPC分类号： G06F17/30 , G06F15/18
CPC分类号： G06F17/30864
摘要： In one embodiment, access one or more query-resource pairs, wherein for each one of the query-resource pairs comprising one of one or more search queries and one of one or more network resources, the one search query is recency-sensitive with respect to a particular time period, and the one network resource is identified for the one search query, and a resource-view count and a resource-click count associated with each one of the query-resource pairs; and construct one or more first click features using the resource-view counts and the resource-click counts associated with the query-resource pairs. To construct one of the first click features in connection with one of the query-resource pairs comprises determine a only-resource-click count associated with the one query-resource pair; and calculate a ratio between the only-resource-click count and the resource-view count associated with the one query-resource pair as the one first click feature.
摘要翻译：在一个实施例中，访问一个或多个查询 - 资源对，其中对于包括一个或多个搜索查询中的一个和一个或多个网络资源中的一个的查询 - 资源对中的每个查询 - 资源对，所述一个搜索查询对于近似度敏感到特定时间段，并且为一个搜索查询标识一个网络资源，以及与每个查询 - 资源对相关联的资源视图计数和资源点击计数; 并使用资源视图计数和与查询 - 资源对相关联的资源点击计数构建一个或多个第一个点击功能。为了构建与其中一个查询 - 资源对相关联的第一个点击功能之一，包括确定与一个查询 - 资源对相关联的唯一资源点击计数; 并且计算唯一的资源点击计数和与一个查询资源对相关联的资源视图计数之间的比率作为一个第一点击特征。

5. 发明授权

US08326815B2 Session based click features for recency ranking 有权
标题翻译：基于会话的点击功能进行新近度排名
公开(公告)号：US08326815B2
公开(公告)日：2012-12-04
申请号：US12725357
申请日：2010-03-16
申请人： Narayanan Sadagopan , Yoshiyuki Inagaki , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
发明人： Narayanan Sadagopan , Yoshiyuki Inagaki , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： In one embodiment, access one or more query chains, wherein each one of the query chains comprises two or more search queries, {q1, . . . , qn}, which are recency-sensitive, are related to the same subject matter, and are issued to a search engine sequentially, and actual click-through information associated with each one of the query chains; and smooth each one of the query chains using the actual click-through information associated with the query chain. To smooth one of the query chains comprises, for each one of search queries, qj, in the query chain, where 2≦j≦n, if one of the network resources identified for qj has actually been clicked in connection with qj by the corresponding one network user, then presume that the one network resource has been clicked in connection with one or more search queries, qk, in the query chain, where 1≦k
摘要翻译：在一个实施例中，访问一个或多个查询链，其中每个查询链包括两个或多个搜索查询{q1，...，。。，qn}，它们是新近度敏感的，与相同的主题相关，并且被顺序地发布到搜索引擎，并且与每个查询链相关联的实际点击信息; 并使用与查询链相关联的实际点击信息来平滑每个查询链。为了平滑一个查询链，对于查询链中的每个搜索查询，包括qj，其中2＆nlE; j＆nlE; n，如果为qj标识的一个网络资源实际上已经被qj与点对点相关联一个网络用户，然后假设一个网络资源已被连接到查询链中的一个或多个搜索查询qk，其中1＆nlE; k

6. 发明申请

US20110231380A1 SESSION BASED CLICK FEATURES FOR RECENCY RANKING 有权
标题翻译：基于会话的点击功能
公开(公告)号：US20110231380A1
公开(公告)日：2011-09-22
申请号：US12725357
申请日：2010-03-16
申请人： Narayanan Sadagopan , Yoshiyuki Inagaki , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
发明人： Narayanan Sadagopan , Yoshiyuki Inagaki , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
IPC分类号： G06F17/30
CPC分类号： G06F17/30864
摘要： In one embodiment, access one or more query chains, wherein each one of the query chains comprises two or more search queries, {q1, . . . , qn}, which are recency-sensitive, are related to the same subject matter, and are issued to a search engine sequentially, and actual click-through information associated with each one of the query chains; and smooth each one of the query chains using the actual click-through information associated with the query chain. To smooth one of the query chains comprises, for each one of search queries, qj, in the query chain, where 2≦j≦n, if one of the network resources identified for qj has actually been clicked in connection with qj by the corresponding one network user, then presume that the one network resource has been clicked in connection with one or more search queries, qk, in the query chain, where 1≦k
摘要翻译：在一个实施例中，访问一个或多个查询链，其中每个查询链包括两个或多个搜索查询{q1，...，。。，qn}，它们是新近度敏感的，与相同的主题相关，并且被顺序地发布到搜索引擎，并且与每个查询链相关联的实际点击信息; 并使用与查询链相关联的实际点击信息来平滑每个查询链。为了平滑一个查询链，对于查询链中的每个搜索查询，包括qj，其中2＆nlE; j＆nlE; n，如果为qj标识的一个网络资源实际上已经被qj与点对点相关联一个网络用户，然后假设一个网络资源已被连接到查询链中的一个或多个搜索查询qk，其中1＆nlE; k

7. 发明授权

US08255390B2 Session based click features for recency ranking 有权
标题翻译：基于会话的点击功能进行新近度排名
公开(公告)号：US08255390B2
公开(公告)日：2012-08-28
申请号：US12725310
申请日：2010-03-16
申请人： Yoshiyuki Inagaki , Narayanan Sadagopan , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
发明人： Yoshiyuki Inagaki , Narayanan Sadagopan , Georges-Eric Albert Marie Robert Dupret , Ciya Liao , Anlei Dong , Yi Chang , Zhaohui Zheng
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30864
摘要： In one embodiment, access one or more query-resource pairs, wherein for each one of the query-resource pairs comprising one of one or more search queries and one of one or more network resources, the one search query is recency-sensitive with respect to a particular time period, and the one network resource is identified for the one search query, and a resource-view count and a resource-click count associated with each one of the query-resource pairs; and construct one or more first click features using the resource-view counts and the resource-click counts associated with the query-resource pairs. To construct one of the first click features in connection with one of the query-resource pairs comprises determine a only-resource-click count associated with the one query-resource pair; and calculate a ratio between the only-resource-click count and the resource-view count associated with the one query-resource pair as the one first click feature.
摘要翻译：在一个实施例中，访问一个或多个查询 - 资源对，其中对于包括一个或多个搜索查询中的一个和一个或多个网络资源中的一个的查询 - 资源对中的每个查询 - 资源对，所述一个搜索查询对于近似度敏感到特定时间段，并且为一个搜索查询标识一个网络资源，以及与每个查询 - 资源对相关联的资源视图计数和资源点击计数; 并使用资源视图计数和与查询资源对相关联的资源点击计数构建一个或多个第一个点击功能。为了构建与其中一个查询 - 资源对相关联的第一个点击功能之一，包括确定与一个查询 - 资源对相关联的唯一资源点击计数; 并且计算唯一的资源点击计数和与一个查询资源对相关联的资源视图计数之间的比率作为一个第一点击特征。

8. 发明授权

US08433712B2 Link analysis for enterprise environment 有权
标题翻译：企业环境链接分析
公开(公告)号：US08433712B2
公开(公告)日：2013-04-30
申请号：US11680548
申请日：2007-02-28
申请人： Hiroshi Koide , Ciya Liao , Cindy Hsin , Meeten Bhavsar
发明人： Hiroshi Koide , Ciya Liao , Cindy Hsin , Meeten Bhavsar
IPC分类号： G06F17/00 , G06F7/00
CPC分类号： G06F17/30979 , G06F21/41
摘要： A flexible and extensible architecture allows for secure searching across an enterprise. Such an architecture can provide a simple Internet-like search experience to users searching secure content inside (and outside) the enterprise. The architecture allows for the crawling and searching of a variety or sources across an enterprise, regardless of whether any of these sources conform to a conventional user role model. The architecture further allows for security attributes to be submitted at query time, for example, in order to provide real-time secure access to enterprise resources. The user query also can be transformed to provide for dynamic querying that provides for a more current result list than can be obtained for static queries.
摘要翻译：灵活可扩展的架构允许跨企业进行安全搜索。这样的架构可以为在企业内部（和外部）搜索安全内容的用户提供简单的类似Internet的搜索体验。该架构允许在整个企业中爬行和搜索各种源，而不管这些源是否符合常规用户角色模型。该体系结构进一步允许在查询时提交安全属性，例如为了提供对企业资源的实时安全访问。用户查询也可以被转换以提供动态查询，其提供比静态查询可获得的更多当前结果列表。

9. 发明申请

US20110258184A1 CHANGING RANKING ALGORITHMS BASED ON CUSTOMER SETTINGS 有权
标题翻译：基于客户定位改变排名算法
公开(公告)号：US20110258184A1
公开(公告)日：2011-10-20
申请号：US13169688
申请日：2011-06-27
申请人： Ciya Liao , Thomas Chang , Muralidhar Krishnaprasad , Meeten Bhavsar
发明人： Ciya Liao , Thomas Chang , Muralidhar Krishnaprasad , Meeten Bhavsar
IPC分类号： G06F17/30
CPC分类号： G06F17/30867 , G06F17/30699
摘要： Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.
摘要翻译：搜索项排序算法可以根据客户设置生成和更新，例如排序算法被建模为不同排名因素的组合函数。搜索系统的最终用户为加权属性提供个性化偏好，一般或单个查询实例。用户还可以通过为因素指定不同的权重来指示一个或多个排名因子的相对重要性。排名因素可以指定文档属性，如文档标题，文档正文，文档页面排名等。基于属性权重和接收到的用户查询，排序算法函数将为每个文档生成与用户偏好相对应的相关值，个性化配置

10. 发明授权

US07996392B2 Changing ranking algorithms based on customer settings 有权
标题翻译：根据客户设置改变排名算法
公开(公告)号：US07996392B2
公开(公告)日：2011-08-09
申请号：US11769245
申请日：2007-06-27
申请人： Ciya Liao , Thomas Chang , Muralidhar Krishnaprasad , Meeten Bhavsar
发明人： Ciya Liao , Thomas Chang , Muralidhar Krishnaprasad , Meeten Bhavsar
IPC分类号： G06F7/00 , G06F17/30
CPC分类号： G06F17/30867 , G06F17/30699
摘要： Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.
摘要翻译：搜索项排序算法可以根据客户设置生成和更新，例如排序算法被建模为不同排名因素的组合函数。搜索系统的最终用户为加权属性提供个性化偏好，一般或单个查询实例。用户还可以通过为因素指定不同的权重来指示一个或多个排名因子的相对重要性。排名因素可以指定文档属性，如文档标题，文档正文，文档页面排名等。基于属性权重和接收到的用户查询，排序算法函数将为每个文档生成与用户偏好相对应的相关值，个性化配置

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式