Comparison of two algorithms for computing page importance

Authors:
Yuting Liu;Zhi-Ming Ma
Affiliations:
Beijing Jiaotong University, School of Science, Beijing, China;Academy of Mathematics and Systems Science, CAS, Beijing, China
Venue:
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Year:
2010

Citing 6
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Combating web spam with trustrank

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
BrowseRank: letting web users vote for page importance

Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval
A framework to compute page importance based on user behaviors

Information Retrieval

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the relation and the difference between two algorithms BrowseRank and PageRank. We analyze their stationary distributions by the ergodic theory of Markov processes. We compare in detail the link graph used in PageRank and the user browsing graph used in BrowseRank. Along with the comparison, the importance of the metadata contained in the user browsing graph is explored.