Abstract
The Google search site (http://www.google.com) exploits the link structure of the Web to measure the relative importance of Web pages. The ranking method implemented in Google is called PageRank [3]. The sum of all PageRank values should be one. However, we notice that the sum becomes less than one in some cases. We present an improved PageRank algorithm that computes the PageRank values of the Web pages correctly. Our algorithm works out well in any situations, and the sum of all PageRank values is always maintained to be one. We also present implementation issues of the improved algorithm. Experimental evaluation is carried out and the results are also discussed.
This work was supported by grant No. (R-01-2000-00403) from the Korea Science and Engineering Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
G. O. Arocena, A. O. Mendelzon, and G. A. Mihaila: Applications of a Web Query Language, Proceedings of WWW6 (1997), 1305–1315
K. Bharat and M. Henzinger: Improved Algorithms for Topic Distillation in Hyperlinked Environments, Proceedings of the 21st ACM SIGIR Conference (1998), 104–111
S. Brin and L. Page: The Anatomy of a Large-Scale Hypertextual Web Search Engine, Proceedings of WWW7 (1998), 107–117
J. Carriere and R. Kazman: Webquery: Searching and Visualizing the Web through Connectivity, Proceedings of WWW6 (1997), 1257–1267
J. Dean and M. R. Henzinger: Finding Related Web Pages in the World Wide Web, Proceedings of WWW8 (1999), 1467–1479
D. Gibson, J. Kleinberg, and P. Raghavan: Inferring Web Communities from Link Topology, Proceedings of the 9th ACM Conference on Hypertext and Hypermedia (1998), 225–234
T. H. Haveliwala: Efficient Computation of PageRank, unpublished manuscript, Stanford University (1999)
E.-J. Im and K. Yelick: Optimizing Sparse Matrix Vector Multiplication on SMPS, Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing (1999), 127–136
J. Kleinberg: Authoritative Sources in a Hyperlinked Environment, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (1998), 604–632
J. Kleinberg, S. R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins: The Web as a Graph: Measurements, Models and Methods, Invited survey at the International Conference on Combinatorics and Computing (1999), 1–17
A. Y. Ng, A. X. Zheng, and M. I. Jordan: Stable Algorithms for Link Analysis, Proceedings of the 24th ACM SIGIR Conference (2001), 258–266
L. Page, S. Brin, R. Motwani, and T. Winograd: The PageRank Citation Ranking: Bringing Order to the Web, unpublished manuscript, Stanford University (1998)
J. Pitkow and P. Pirolli: Life, Death, and Lawfulness on the Electronic Frontier, Proceedings of the Conference on Human Factors in Computing Systems (CHI 97) (1997), 383–390
P. Pirolli, J. Pitkow, and R. Rao: Silk from a Sow’s Ear: Extracting Usable Structures from the Web, Proceedings of the Conference on Human Factors in Computing Systems (CHI 96) (1996), 118–125
E. Spertus: ParaSite: Mining Structural Information on the Web, Proceedings of WWW6 (1997), 1205–1215
S. Toledo: Improving the Memory-system Performance of Sparse-matrix Vector Multiplication, IBM Journal of Research and Development, volume 41 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, S.J., Lee, S.H. (2002). An Improved Computation of the PageRank Algorithm. In: Crestani, F., Girolami, M., van Rijsbergen, C.J. (eds) Advances in Information Retrieval. ECIR 2002. Lecture Notes in Computer Science, vol 2291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45886-7_5
Download citation
DOI: https://doi.org/10.1007/3-540-45886-7_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43343-9
Online ISBN: 978-3-540-45886-9
eBook Packages: Springer Book Archive