A punishment/reward based approach to ranking
Pedram Ghodsnia, Ali Mohammad Zareh Bidoki, Nasser Yazdani · Scalable Information Systems · 2007
One of the important challenges in current search engines is dealing with the get 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.