The Mathematics of Internet Search Engines
(2007) In Preprints in Mathematical Sciences- Abstract
- This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source
such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with
link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/960186
- author
- Andersson, Fredrik and Silvestrov, Sergei LU
- organization
- publishing date
- 2007
- type
- Contribution to journal
- publication status
- unpublished
- subject
- keywords
- Power series, Power method, Citation ranking, Search engines, PageRank, Information retrieval, Text indexing, Markov chains, Ranking
- in
- Preprints in Mathematical Sciences
- issue
- 10
- pages
- 39 pages
- publisher
- Lund University
- external identifiers
-
- other:LUTFMA-5085-2007/1-39/(2007)
- ISSN
- 1403-9338
- project
- Non-commutative Analysis of Dynamics, Fractals and Wavelets
- Non-commutative Geometry in Mathematics and Physics
- language
- English
- LU publication?
- yes
- id
- ded1293d-684c-4168-9547-2d3bb98cb50a (old id 960186)
- date added to LUP
- 2016-04-04 09:35:38
- date last changed
- 2018-11-21 20:54:13
@article{ded1293d-684c-4168-9547-2d3bb98cb50a, abstract = {{This article presents a survey of techniques for ranking results in search engines, with emphasis on link-based ranking methods and the PageRank algorithm. The problem of selecting, in relation to a user search query, the most relevant documents from an unstructured source<br/><br> such as the WWW is discussed in detail. The need for extending classical information retrieval techniques such as boolean searching and vector space models with <br/><br> link-based ranking methods is demonstrated. The PageRank algorithm is introduced, and its numerical and spectral properties are discussed. The article concludes with an alternative means of computing PageRank, along with some example applications of this new method.}}, author = {{Andersson, Fredrik and Silvestrov, Sergei}}, issn = {{1403-9338}}, keywords = {{Power series; Power method; Citation ranking; Search engines; PageRank; Information retrieval; Text indexing; Markov chains; Ranking}}, language = {{eng}}, number = {{10}}, publisher = {{Lund University}}, series = {{Preprints in Mathematical Sciences}}, title = {{The Mathematics of Internet Search Engines}}, year = {{2007}}, }