The Community for Technology Leaders
Web Intelligence, IEEE / WIC / ACM International Conference on (2005)
Compi?gne University of Technology, France
Sept. 19, 2005 to Sept. 22, 2005
ISBN: 0-7695-2415-X
pp: 543-549
Philip S. Yu , IBM T.J. Watson Research Center
Xin Li , University of Illinois at Chicago
Bing Liu , University of Illinois at Chicago
The most well known search techniques are perhaps the PageRank and HITS algorithms. In this paper we argue that these algorithms miss an important dimension, the temporal dimension. 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. Research publication search has the same problem. If we use the PageRank or HITS algorithm, those older or classic papers will be ranked high due to the large number of citations that they received in the past. This paper studies the temporal dimension of search in the context of research publication. A number of methods are proposed to deal with the problem based on analyzing the behavior history and the source of each publication. These methods are evaluated empirically. Our results show that they are highly effective.

P. S. Yu, B. Liu and X. Li, "Adding the Temporal Dimension to Search — A Case Study in Publication Search," Proceedings. The 2005 IEEE/WIC/ACM International Conference on Web Intelligence(WI), Compiegne, France, 2005, pp. 543-549.
86 ms
(Ver 3.3 (11022016))