Years and Authors of Summarized Original Work
1998; Brin, Page
Problem Definition
Given a user query, current web search services retrieve all web pages that contain the query terms resulting in a huge number of web pages for the majority of searches. Thus it is crucial to reorder or rankthe resulting documents with the goal of placing the most relevant documents first. Frequently, ranking uses two types of information: (1) query-specific information and (2) query-independent information. The query-specific part tries to measure how relevant the document is to the query. Since it depends to a large part on the content of the page, it is mostly under the control of the page’s author. The query-independent information tries to estimate the quality of the page in general. To achieve an objective measure of page quality, it is important that the query-independent information incorporates a measure that is not controlled by the author. Thus the problem is to find a measure of page quality...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Berkhin P (2005) A survey on PageRank computing. Internet Math 2(1):73–120
Brin S, Page L (1998) The anatomy of a large-scale hypertextual Web search engine. In: Proceedings of the 7th international conference on World Wide Web. Elsevier, Amsterdam, Brisbane, Australia, pp 107–117
Haveliwala T, Kamvar S, Jeh G (2003) An analytical comparison of approaches to personalizing PageRank. Technical report, Stanford University, Stanford
Langville AN, Meyer CD (2004) Deeper inside PageRank. Internet Math 1(3):335–380
Page L, Brin S, Motwani R, Winograd T (1998) The PageRank citation ranking: bringing order to the Web. Technical report, Stanford University, Stanford
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Henzinger, M. (2016). PageRank Algorithm. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_277
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_277
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering