On the temporal dimension of search

Philip S. Yu, Xin Li, B. Liu
{"title":"On the temporal dimension of search","authors":"Philip S. Yu, Xin Li, B. Liu","doi":"10.1145/1013367.1013519","DOIUrl":null,"url":null,"abstract":"Web search is probably the single most important application on the Internet. The most famous search techniques are perhaps the PageRank and HITS algorithms. These algorithms are motivated by the observation that a hyperlink from a page to another is an implicit conveyance of authority to the target page. They exploit this social phenomenon to identify quality pages, e.g., \"authority\" pages and \"hub\" pages. In this paper we argue that these algorithms miss an important dimension of the Web, the temporal dimension. The Web is not a static environment. It changes constantly. Quality pages in the past may not be quality pages now or in the future. These techniques favor older pages because these pages have many in-links accumulated over time. New pages, which may be of high quality, have few or no in-links and are left behind. Bringing new and quality pages to users is important because most users want the latest information. Research publication search has exactly the same problem. This paper studies the temporal dimension of search in the context of research publication search. We propose a number of methods deal with the problem. Our experimental results show that these methods are highly effective.","PeriodicalId":409891,"journal":{"name":"WWW Alt. '04","volume":" 3","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"71","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"WWW Alt. '04","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013367.1013519","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 71

Abstract

Web search is probably the single most important application on the Internet. The most famous search techniques are perhaps the PageRank and HITS algorithms. These algorithms are motivated by the observation that a hyperlink from a page to another is an implicit conveyance of authority to the target page. They exploit this social phenomenon to identify quality pages, e.g., "authority" pages and "hub" pages. In this paper we argue that these algorithms miss an important dimension of the Web, the temporal dimension. The Web is not a static environment. It changes constantly. Quality pages in the past may not be quality pages now or in the future. These techniques favor older pages because these pages have many in-links accumulated over time. New pages, which may be of high quality, have few or no in-links and are left behind. Bringing new and quality pages to users is important because most users want the latest information. Research publication search has exactly the same problem. This paper studies the temporal dimension of search in the context of research publication search. We propose a number of methods deal with the problem. Our experimental results show that these methods are highly effective.
关于搜索的时间维度
网络搜索可能是因特网上最重要的一个应用程序。最著名的搜索技术可能是PageRank和HITS算法。这些算法的动机是观察到从一个页面到另一个页面的超链接是对目标页面的隐式权限传递。他们利用这种社会现象来识别高质量的页面,例如“权威”页面和“中心”页面。在本文中,我们认为这些算法忽略了Web的一个重要维度,即时间维度。Web不是一个静态的环境。它不断变化。过去的高质量页面可能不是现在或将来的高质量页面。这些技术偏爱较老的页面,因为这些页面有许多随时间积累的内链接。新页面,可能是高质量的,有很少或没有链接,并留下。为用户提供新的高质量页面非常重要,因为大多数用户都希望获得最新的信息。研究出版物搜索也有同样的问题。本文研究了研究出版物检索中检索的时间维度。我们提出了一些处理这个问题的方法。实验结果表明,这些方法是非常有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信