Time Sensitive Ranking with Application to Publication Search

Link-based ranking has contributed significantly to the success of Web search. PageRank and HITS are the best known link-based ranking algorithms. These algorithms do not consider an important dimension, the temporal dimension. They favor older pages because these pages have many in-links accumulated over time. Bringing new and quality pages to the users is important because most users want the latest information. Existing remedies to PageRank are mostly heuristic approaches. This paper investigates the temporal aspect of ranking with application to publication search, and proposes a principled method based on the stationary probability distribution of the Markov chain. The proposed techniques are evaluated empirically using a large collection of high energy particle physics publication. The results show that the proposed methods are highly effective.

[1]  Philip S. Yu,et al.  Adding the temporal dimension to search - a case study in publication search , 2005, The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05).

[2]  Junghoo Cho,et al.  Page quality: in search of an unbiased web ranking , 2005, SIGMOD '05.

[3]  Sebastiano Vigna,et al.  PageRank as a function of the damping factor , 2005, WWW '05.

[4]  Wei-Ying Ma,et al.  Object-level ranking: bringing order to Web objects , 2005, WWW '05.

[5]  Frank McSherry,et al.  A uniform approach to accelerated PageRank computation , 2005, WWW '05.

[6]  Sandeep Pandey,et al.  Shuffling a Stacked Deck: The Case for Partially Randomized Ranking of Search Engine Results , 2005, VLDB.

[7]  Torsten Suel,et al.  Local methods for estimating pagerank values , 2004, CIKM '04.

[8]  Wei-Ying Ma,et al.  Block-level link analysis , 2004, SIGIR '04.

[9]  Andrei Z. Broder,et al.  Sic transit gloria telae: towards an understanding of the web's decay , 2004, WWW '04.

[10]  Christopher Olston,et al.  What's new on the web?: the evolution of the web from a search engine perspective , 2004, WWW '04.

[11]  Junghoo Cho,et al.  Impact of search engines on page popularity , 2004, WWW '04.

[12]  C. Lee Giles.  CiteSeer: Past, Present, and Future , 2004, AWIC.

[13]  Mark Levene,et al.  Web Dynamics , 2004, Springer Berlin Heidelberg.

[14]  Brian D. Davison.  Toward a unification of text and link analysis , 2003, SIGIR.

[15]  Gene H. Golub,et al.  Extrapolation methods for accelerating PageRank computations , 2003, WWW '03.

[16]  John A. Tomlin,et al.  A new paradigm for ranking pages on the world wide web , 2003, WWW '03.

[17]  Ronald Fagin,et al.  Searching the workplace web , 2003, WWW '03.

[18]  Serge Abiteboul,et al.  Adaptive on-line page importance computation , 2003, WWW '03.

[19]  Andrew Tomkins,et al.  Social Networks: From the Web to Knowledge Management , 2003 .

[20]  Ricardo Baeza-Yates,et al.  Web structure, age and page quality , 2002, WWW 2002.

[21]  Ricardo A. Baeza-Yates,et al.  Web Structure, Dynamics and Page Quality , 2002, SPIRE.

[22]  Marco Gori,et al.  Web page scoring systems for horizontal and vertical search , 2002, WWW.

[23]  Ravi Kumar,et al.  Self-similarity in the web , 2001, TOIT.

[24]  Susan T. Dumais,et al.  Probabilistic combination of content and links , 2001, SIGIR '01.

[25]  Amos Fiat,et al.  Web search via hub synthesis , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[26]  Sriram Raghavan,et al.  Searching the Web , 2001, ACM Trans. Internet Techn..

[27]  Allan Borodin,et al.  Finding authorities and hubs from link structures on the World Wide Web , 2001, WWW '01.

[28]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[29]  Shlomo Moran,et al.  The stochastic approach for link-structure analysis (SALSA) and the TKC effect , 2000, Comput. Networks.

[30]  Andrei Z. Broder,et al.  Graph structure in the Web , 2000, Comput. Networks.

[31]  C. Lee Giles,et al.  Indexing and retrieval of scientific literature , 1999, CIKM '99.

[32]  M. KleinbergJon.  Authoritative sources in a hyperlinked environment , 1999 .

[33]  Jon M. Kleinberg,et al.  The Web as a Graph: Measurements, Models, and Methods , 1999, COCOON.

[34]  Martin van den Berg,et al.  Focused Crawling: A New Approach to Topic-Specific Web Resource Discovery , 1999, Comput. Networks.

[35]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[36]  Andrei Z. Broder,et al.  A Technique for Measuring the Relative Size and Overlap of Public Web Search Engines , 1998, Comput. Networks.

[37]  Jon M. Kleinberg,et al.  Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text , 1998, Comput. Networks.

[38]  Krishna Bharat,et al.  Improved algorithms for topic distillation in a hyperlinked environment , 1998, SIGIR '98.

[39]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[40]  P. Diaconis.  Group representations in probability and statistics , 1988 .