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.
This work is done at Microsoft Research Asia.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arasu, A.: PageRank Computation and the Structure of the Web: Experiments and Algorithms. In: 11th International WWW Conference (May 2002)
Medina, A., Matta, I., Byers, J.: On the Origin of Power Laws in Internet Topologies. ACM Computer Communication Review 30(2), 18–28 (2000)
Golub, G.H., Van Loan, C.F.: Matrix Computations. The Johns Hopkins University Press, Baltimore (1996)
Kleinberg, J.: Authoritative sources in a hyperlinked environment. Journal of the ACM 46, 604–632 (1999)
Faloutsos, M., Faloutsos, P., Faloutsos, C.: On Power-Law Relationships of the Internet Topology. In: Proceedings of ACM SIGCOMM (August 1999)
Chen, Q., Chang, H., Govindan, R., et al.: The Origin of Power Laws in Internet Topologies Revisited. In: Proceedings of IEEE INFOCOM 2002 (2002)
Brin, S., Page, L., Motwami, R., Winograd, T.: The PageRank citation ranking: bringing order to the web. Stanford University Technical Report (1998)
Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Exploiting the Block Structure of the Web for Computing. Stanford University Technical Report (2003)
Lu, Y., Zhang, B., Xi, W., Zhen, C., et al.: The PowerRank Web Link Analysis Algorithm. In: Proceedings of 13th International WWW Conference (May 2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lu, Y. et al. (2005). Efficient PageRank with Same Out-Link Groups. In: Myaeng, S.H., Zhou, M., Wong, KF., Zhang, HJ. (eds) Information Retrieval Technology. AIRS 2004. Lecture Notes in Computer Science, vol 3411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31871-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-31871-2_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25065-4
Online ISBN: 978-3-540-31871-2
eBook Packages: Computer ScienceComputer Science (R0)