WPR: a Weighted Approach to PageRank

P. Ghodsnia(1*), A. M. Z. Bidoki(2), N. Yazdani(3)

(1) School of electrical and Computer Engineering, University of Tehran, Iran, Islamic Republic of
(2) School of electrical and Computer Engineering, University of Tehran, Iran, Islamic Republic of
(3) School of electrical and Computer Engineering, University of Tehran, Iran, Islamic Republic of
(*) Corresponding author


DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)

Abstract


The PageRank algorithm which is used by google as a successful ranking algorithm for ranking its results can be interpreted as leveraging the recommendations of all the other page creators on the web, about how important a page is. But it does not take advantage of the recommendations of page visitors. In PageRank, every page creator propagates the importance score of her/his page to its outgoing links uniformly. In this paper a revised version of PageRank called Weighted PageRank (WPR) is proposed in which this uniform propagation is transformed into a weighted one. These weights are assigned to outgoing links based on the average opinion of page visitors about the importance of pages. This opinion is recorded from search engine logs indicating which search results were clicked most. It is demonstrated that our approach is simply applicable without any significant extra time and storage costs compared to PageRank.
Copyright © 2018 Praise Worthy Prize - All rights reserved.

Keywords


PageRank, Search Engin, Ranking, Random Surfer Model

Full Text:

PDF


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2019 Praise Worthy Prize