-
公开(公告)号：US20110246457A1
公开(公告)日：2011-10-06
申请号：US12749972
申请日：2010-03-30
申请人： Anlei Dong , Pranam Kolari , Ruiqiang Zhang , Jing Bai , Yi Chang , Zhaohui Zheng
发明人： Anlei Dong , Pranam Kolari , Ruiqiang Zhang , Jing Bai , Yi Chang , Zhaohui Zheng
CPC分类号： G06Q10/06 , G06F17/30864 , G06Q50/01
摘要： An information retrieval system is described herein that monitors a microblog data stream that includes microblog posts to discover and index fresh resources for searching by a search engine. The information retrieval system also uses data from the microblog data stream as well as data obtained from a microblog subscription system to compute novel and effective features for ranking fresh resources which would otherwise have impoverished representations. An embodiment of the present invention advantageously enables a search engine to produce a fresher set of resources and to rank such resources for both relevancy and freshness in a more accurate manner.
摘要翻译： 本文描述了一种信息检索系统，其监视包括微博帖子的微博数据流，以发现和索引新的资源以供搜索引擎搜索。 信息检索系统还使用来自微博数据流的数据以及从微博订阅系统获得的数据来计算新颖而有效的特征来排列否则将具有贫困表示的新鲜资源。 本发明的一个实施例有利地使得搜索引擎能够产生更新鲜的资源集合，并且以更准确的方式对相关性和新鲜度进行排名。
-
公开(公告)号：US20120042020A1
公开(公告)日：2012-02-16
申请号：US12857000
申请日：2010-08-16
申请人： Pranam Kolari , Ruiqiang Zhang , Yi Chang , Anlei Dong , Zhaohui Zheng , Lei Duan
发明人： Pranam Kolari , Ruiqiang Zhang , Yi Chang , Anlei Dong , Zhaohui Zheng , Lei Duan
IPC分类号： G06F15/16
CPC分类号： G06Q10/107
摘要： Example methods, apparatuses, or articles of manufacture are disclosed that may be implemented using one or more computing devices to provide or otherwise support micro-blog message filtering.
摘要翻译： 公开了可以使用一个或多个计算设备实现以提供或以其他方式支持微博消息过滤的示例性方法，设备或制品。
-
公开(公告)号：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.
摘要翻译： 在一个实施例中，访问包括一个或多个新近度搜索查询和一个或多个新近度搜索结果的一组新近度排序数据，每个新近度搜索查询相对于特定时间段是新近敏感度，并且与查询时间戳相关联 表示在搜索引擎处接收到新近度搜索查询的时间，每个新近度搜索结果由搜索引擎为新近搜索查询之一生成，并且包括一个或多个新近网络资源。 从新近度排序数据集合构建多个新近特征。 通过机器学习，至少使用新特性来训练第一个排名榜。
-
公开(公告)号：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.
摘要翻译： 在一个实施例中，访问包括一个或多个新近度搜索查询和一个或多个新近度搜索结果的一组新近度排序数据，每个新近度搜索查询相对于特定时间段是新近敏感度，并且与查询时间戳相关联 表示在搜索引擎处接收到新近度搜索查询的时间，每个新近度搜索结果由搜索引擎为新近搜索查询之一生成，并且包括一个或多个新近网络资源。 从新近度排序数据集合构建多个新近特征。 通过机器学习，至少使用新特性来训练第一个排名榜。
-
公开(公告)号：US08751511B2
公开(公告)日：2014-06-10
申请号：US12749972
申请日：2010-03-30
申请人： Anlei Dong , Pranam Kolari , Ruiqiang Zhang , Jing Bai , Yi Chang , Zhaohui Zheng
发明人： Anlei Dong , Pranam Kolari , Ruiqiang Zhang , Jing Bai , Yi Chang , Zhaohui Zheng
CPC分类号： G06Q10/06 , G06F17/30864 , G06Q50/01
摘要： An information retrieval system is described herein that monitors a microblog data stream that includes microblog posts to discover and index fresh resources for searching by a search engine. The information retrieval system also uses data from the microblog data stream as well as data obtained from a microblog subscription system to compute novel and effective features for ranking fresh resources which would otherwise have impoverished representations. An embodiment of the present invention advantageously enables a search engine to produce a fresher set of resources and to rank such resources for both relevancy and freshness in a more accurate manner.
摘要翻译： 本文描述了一种信息检索系统，其监视包括微博帖子的微博数据流，以发现和索引新的资源以供搜索引擎搜索。 信息检索系统还使用来自微博数据流的数据以及从微博订阅系统获得的数据来计算新颖而有效的特征来排列否则将具有贫困表示的新鲜资源。 本发明的一个实施例有利地使得搜索引擎能够产生更新鲜的资源集合，并且以更准确的方式对相关性和新鲜度进行排名。
-
公开(公告)号：US20110087655A1
公开(公告)日：2011-04-14
申请号：US12576534
申请日：2009-10-09
申请人： Ruiqiang Zhang , Yi Chang , Anlei Dong , Zhaohui Zheng
发明人： Ruiqiang Zhang , Yi Chang , Anlei Dong , Zhaohui Zheng
IPC分类号： G06F17/30
CPC分类号： G06F16/9535
摘要： In one embodiment, a method comprises accessing a search query received at a search engine; identifying a plurality of network resources for the search query; calculating a ranking score for each of the network resources; determining whether the search query is year-qualified; and if the search query is year-qualified, then adjusting the ranking scores of selected ones of the network resources based on a difference between the ranking score of an oldest one of the network resources and the ranking score of a newest one of the network resources and a confidence score representing a likelihood that the search query is year-qualified.
摘要翻译： 在一个实施例中，一种方法包括访问在搜索引擎处接收的搜索查询; 识别搜索查询的多个网络资源; 计算每个网络资源的排名得分; 确定搜索查询是否合格; 并且如果搜索查询是合格的，则基于网络资源中最老的一个网络资源的排名分数与最新的一个网络资源的排名得分之间的差异来调整所选择的网络资源的排名得分 以及表示搜索查询符合年限的可能性的置信度分数。
-
公开(公告)号：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
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
-
公开(公告)号：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
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.
摘要翻译： 在一个实施例中，访问一个或多个查询 - 资源对，其中对于包括一个或多个搜索查询中的一个和一个或多个网络资源中的一个的查询 - 资源对中的每个查询 - 资源对，所述一个搜索查询对于近似度敏感 到特定时间段，并且为一个搜索查询标识一个网络资源，以及与每个查询 - 资源对相关联的资源视图计数和资源点击计数; 并使用资源视图计数和与查询 - 资源对相关联的资源点击计数构建一个或多个第一个点击功能。 为了构建与其中一个查询 - 资源对相关联的第一个点击功能之一，包括确定与一个查询 - 资源对相关联的唯一资源点击计数; 并且计算唯一的资源点击计数和与一个查询资源对相关联的资源视图计数之间的比率作为一个第一点击特征。
-
公开(公告)号：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
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.
摘要翻译： 在一个实施例中，访问一个或多个查询 - 资源对，其中对于包括一个或多个搜索查询中的一个和一个或多个网络资源中的一个的查询 - 资源对中的每个查询 - 资源对，所述一个搜索查询对于近似度敏感 到特定时间段，并且为一个搜索查询标识一个网络资源，以及与每个查询 - 资源对相关联的资源视图计数和资源点击计数; 并使用资源视图计数和与查询资源对相关联的资源点击计数构建一个或多个第一个点击功能。 为了构建与其中一个查询 - 资源对相关联的第一个点击功能之一，包括确定与一个查询 - 资源对相关联的唯一资源点击计数; 并且计算唯一的资源点击计数和与一个查询资源对相关联的资源视图计数之间的比率作为一个第一点击特征。
-
公开(公告)号：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
-
-
-
-
-
-
-
-
-
搜索结果
53 条记录 (耗时 0.023 秒)
