Towards recency ranking in web search
Proceedings of the third ACM international conference on Web search and data mining
Towards an effective and unbiased ranking of scientific literature through mutual reinforcement
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
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.