Efficient pagerank with same out-link groups

Authors:
Yizhou Lu;Xuezheng Liu;Hua Li;Benyu Zhang;Wensi Xi;Zheng Chen;Shuicheng Yan;Wei-Ying Ma
Affiliations:
School of Mathematical Sciences, Peking University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;School of Mathematical Sciences, Peking University, Beijing, P.R. China;Microsoft Research Asia, Beijing, P.R. China;Virginia Polytechnic Institute and State University, Blacksburg, VA;Microsoft Research Asia, Beijing, P.R. China;Microsoft Research Asia, Beijing, P.R. China;Microsoft Research Asia, Beijing, P.R. China
Venue:
AIRS'04 Proceedings of the 2004 international conference on Asian Information Retrieval Technology
Year:
2004

Citing 5
Cited 0

Matrix computations (3rd ed.)

Matrix computations (3rd ed.)
On power-law relationships of the Internet topology

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Authoritative sources in a hyperlinked environment

Journal of the ACM (JACM)
On the origin of power laws in Internet topologies

ACM SIGCOMM Computer Communication Review
The powerrank web link analysis algorithm

Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditional PageRank algorithm suffers from heavy computation cost due to the huge number of web pages. In this paper, we propose a more efficient algorithm to compute the pagerank value for each web page directly on the same out-link groups. This new algorithm groups the pages with the same out-link behavior (SOLB) as a unit. It is proved that the derived PageRank is the same as that from the original PageRank algorithm which calculates over single webpage; while our proposed algorithm improve the efficiency greatly. For simplicity, we restrict the group within a directory and define metrics to measure the similarity of the pages in same out-link behavior. We design the experiments to group from 0.5 liked to exact SOLB pages; the results show that such group offers similar rank scores as traditional PageRank algorithm does and achieves a remarkable 50% on efficiency.