Skip to main content
Springer Nature Link
Log in

Comparison of Two Algorithms for Computing Page Importance

  • Conference paper
Algorithmic Aspects in Information and Management (AAIM 2010)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6124))

Included in the following conference series:

  • 716 Accesses

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 to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. 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)

    Article  Google Scholar 

  2. Deng, Y., Liang, Z.: Stochastic Point Processes and Their Applications. Science Press, Beijing (1998) (in Chinese)

    Google Scholar 

  3. Golub, G.H., Loan, C.F.V.: Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)

    MATH  Google Scholar 

  4. Gyöngyi, Z., Garcia-Molina, H.: Web spam taxonomy. Technical Report TR 2004-25, Stanford University (2004)

    Google Scholar 

  5. 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)

    Google Scholar 

  6. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. In: SODA 1998, Philadelphia, PA, USA, pp. 668–677 (1998)

    Google Scholar 

  7. Langville, A.N., Meyer, C.D.: Deeper inside pagerank. Internet Mathematics 1(3), 335–400 (2004)

    MATH  MathSciNet  Google Scholar 

  8. 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)

    Chapter  Google Scholar 

  9. 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)

    Article  Google Scholar 

  10. 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)

    Google Scholar 

  11. Qian, M.P., Gong, G.L.: Stochastic Process. Second version. Peking University Press (1997) (in Chinese)

    Google Scholar 

  12. Stewart, W.J.: Introduction to the Numerical Solution of Markov Chains. Princeton University Press, Princeton (1994)

    MATH  Google Scholar 

  13. Stroock, D.W.: An Introduction to Markov Processes, Graduate Texts in Mathematics. Springer, Heidelberg (2005)

    Google Scholar 

  14. Wang, Z.K., Yang, X.Q.: Birth and Death Processes and Markov Chains. Springer, New York (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Science, Beijing Jiaotong University, Beijing, China, 100044

    Yuting Liu

  2. CAS, Academy of Mathematics and Systems Science, Beijing, China, 100190

    Zhi-Ming Ma

Authors
  1. Yuting Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhi-Ming Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Warwick Business School/ DIMAP - Centre for Discrete Mathematics and its Applications Coventry, University of Warwick, CV4 7AL, UK

    Bo Chen

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics