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.
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
Brin, S., Page, L.: The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems 30(1-7), 107–117 (1998)
Deng, Y., Liang, Z.: Stochastic Point Processes and Their Applications. Science Press, Beijing (1998) (in Chinese)
Golub, G.H., Loan, C.F.V.: Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)
Gyöngyi, Z., Garcia-Molina, H.: Web spam taxonomy. Technical Report TR 2004-25, Stanford University (2004)
Gyöngyi, Z., Garcia-Molina, H., Pedersen, J.: Combating web spam with trustrank. In: VLDB 2004: Proceedings of the Thirtieth International Conference on Very Large Data Bases, pp. 576–587, VLDB Endowment (2004)
Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: SODA 1998, Philadelphia, PA, USA, pp. 668–677 (1998)
Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathematics 1(3), 335–400 (2004)
Liu, Y., Gao, B., Liu, T.-Y., Zhang, Y., Ma, Z., He, S., Li, H.: BrowseRank: letting web users vote for page importance. In: SIGIR 2008: Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 451–458. ACM, New York (2008)
Liu, Y., Liu, T.-Y., Gao, B., Ma, Z., Li, H.: A framework to compute page importance based on user behaviors. Information Retrieval 13(1), 22–45 (2010)
Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford InfoLab, Previous number = SIDL-WP-1999-0120 (November 1999)
Qian, M.P., Gong, G.L.: Stochastic Process. Second version. Peking University Press (1997) (in Chinese)
Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)
Stroock, D.W.: An Introduction to Markov Processes, Graduate Texts in Mathematics. Springer, Heidelberg (2005)
Wang, Z.K., Yang, X.Q.: Birth and Death Processes and Markov Chains. Springer, New York (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liu, Y., Ma, ZM. (2010). Comparison of Two Algorithms for Computing Page Importance. In: Chen, B. (eds) Algorithmic Aspects in Information and Management. AAIM 2010. Lecture Notes in Computer Science, vol 6124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14355-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-14355-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14354-0
Online ISBN: 978-3-642-14355-7
eBook Packages: Computer ScienceComputer Science (R0)