Referenced Items are not available for this document.
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.
Published in:
Data Mining, 2008. ICDM '08. Eighth IEEE International Conference on
Date of Conference: 15-19 Dec. 2008
- Page(s):
- 893 - 898
- ISSN :
- 1550-4786
- Print ISBN:
- 978-0-7695-3502-9
- INSPEC Accession Number:
- 10472227
- Conference Location :
- Pisa
- Digital Object Identifier :
- 10.1109/ICDM.2008.155
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
