Research Article
A punishment/reward based approach to ranking
@INPROCEEDINGS{10.4108/infoscale.2007.85, author={Pedram Ghodsnia and Ali Mohammad Zareh Bidok and Nasser Yazdani}, title={A punishment/reward based approach to ranking}, proceedings={2nd International ICST Conference on Scalable Information Systems}, publisher={ACM}, proceedings_a={INFOSCALE}, year={2010}, month={5}, keywords={Ranking PageRank Relevance Feedback Search Engine}, doi={10.4108/infoscale.2007.85} }- Pedram Ghodsnia
Ali Mohammad Zareh Bidok
Nasser Yazdani
Year: 2010
A punishment/reward based approach to ranking
INFOSCALE
ICST
DOI: 10.4108/infoscale.2007.85
Abstract
One of the important challenges in current search engines is dealing with the "rich get richer" problem. In popularity-based ranking algorithms like PageRank, due to considering the structure of the web as the measure for ranking the pages, newly-created but highly-qualified pages are effectively disregarded shoot out, and can take a very long time before becoming popular. In this paper we present a new punishment/reward based approach that adds a new dimension to the PageRank model for reducing the effect of the rich get richer problem using implicit feedback of visitors. In this approach, in addition to considering the structure of links as a page-creator's point of view, we use the page-visitor's view as an important parameter to improve the accuracy of the PageRank algorithm.
