• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Information Processing & Management >Comparing rankings of search results on the Web
【24h】

Comparing rankings of search results on the Web

机译：在网络上比较搜索结果的排名

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The Web has become an information source for professional data gathering. Because of the vast amounts of information on almost all topics, one cannot systematically go over the whole set of results, and therefore must rely on the ordering of the results by the search engine. It is well known that search engines on the Web have low overlap in terms of coverage. In this study we measure how similar are the rankings of search engines on the overlapping results.We compare rankings of results for identical queries retrieved from several search engines. The method is based only on the set of URLs that appear in the answer sets of the engines being compared. For comparing the similarity of rankings of two search engines, the Spearman correlation coefficient is computed. When comparing more than two sets Kendall's W is used. These are well-known measures and the statistical significance of the results can be computed. The methods are demonstrated on a set of 15 queries that were submitted to four large Web search engines. The findings indicate that the large public search engines on the Web employ considerably different ranking algorithms. (c) 2005 Elsevier Ltd. All rights reserved.
机译：Web已经成为专业数据收集的信息源。由于涉及几乎所有主题的大量信息，因此无法系统地浏览整个结果集，因此必须依靠搜索引擎对结果的排序。众所周知，Web上的搜索引擎在覆盖范围方面具有较低的重叠。在这项研究中，我们测量了重叠结果上搜索引擎的排名有多相似。我们比较了从多个搜索引擎检索到的相同查询的结果排名。该方法仅基于出现在要比较的引擎的答案集中的URL集。为了比较两个搜索引擎的排名相似度，计算了Spearman相关系数。比较两个以上的集合时，将使用Kendall的W。这些是众所周知的度量，可以计算结果的统计显着性。在提交给四个大型Web搜索引擎的15个查询中展示了这些方法。调查结果表明，Web上的大型公共搜索引擎采用了截然不同的排名算法。 （c）2005 Elsevier Ltd.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号