文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Temporal Ranking of Search Engine Results
侵权投诉

Temporal Ranking of Search Engine Results

Abstract. Existing search engines contain the picture of the Web from the past and their ranking algorithms are based on data crawled some time ago. However, a user requires not only relevant but also fresh information. We have developed a method for adjus

Temporal Ranking of Search Engine Results

Adam Jatowt1, Yukiko Kawai1, and Katsumi Tanaka2

1 National Institute of Information and Communications Technology,

3-5 Hikaridai, Seika-cho, Soraku-gun, 619-0289, Kyoto, Japan {adam, yukiko}@nict.go.jp 2 Graduate School of Informatics, Kyoto University,

Yoshida-Honmachi, Sakyo-ku, 606-8501, Kyoto, Japan ktanaka@i.kyoto-u.ac.jp

Abstract. Existing search engines contain the picture of the Web from the past

and their ranking algorithms are based on data crawled some time ago. How-

ever, a user requires not only relevant but also fresh information. We have de-

veloped a method for adjusting the ranking of search engine results from the

point of view of page freshness and relevance. It uses an algorithm that post-

processes search engine results based on the changed contents of the pages. By

analyzing archived versions of web pages we estimate temporal qualities of

pages, that is, general freshness and relevance of the page to the query topic

over certain time frames. For the top quality web pages, their content differ-

ences between past snapshots of the pages indexed by a search engine and their

present versions are analyzed. Basing on these differences the algorithm assigns

new ranks to the web pages without the need to maintain a constantly updated

index of web documents.

1 Introduction

The Web has become the biggest information repository in the world, thus crawling the content of the Web takes a long time. Because web documents can change often, it is difficult to retrieve the freshest information. One strategy for coping with this prob-lem is to customize the crawling patterns to match the frequency of changes to par-ticular web pages. This works reasonably well for pages that change regularly and predictably, like news pages. However, the majority of web resources change in an arbitrary fashion. Thus, search engines cannot retrieve all recently modified content in real time and consequently contain older versions of web pages in their indexes. For example, according to one study, Google [11] crawls web documents with an average delay of one month [19]. This is unacceptable to users who require fresh and relevant information. They often cannot obtain information that is sufficiently fresh simply because the pages have not been crawled over frequently enough. Consequently, users may receive information that is out-of-date or already known to them, or that may even be no longer correct. Search engines generally calculate page ranks using cached versions of pages, which might be obsolete. Thus, the highest ranks may be assigned to the pages that are “popular” and relevant to the query topic but may not necessarily contain the freshest information.

M. Kitsuregawa et al. (Eds.): WISE 2005, LNCS 3806, pp. 43 – 52, 2005.

© Springer-Verlag Berlin Heidelberg 2005

第1页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email