Skip to main content

Lund University Publications

LUND UNIVERSITY LIBRARIES

The mathematics of internet search engines

Andersson, F. K. and Silvestrov, Sergei LU (2008) In Acta Applicandae Mathematicae 104(2). p.211-242
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:
author
and
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
citation ranking, PageRank, search engines, information retrieval, text, indexing, ranking, Markov chains, power method, power series
in
Acta Applicandae Mathematicae
volume
104
issue
2
pages
211 - 242
publisher
Springer
external identifiers
  • wos:000259554200010
  • scopus:52949107207
ISSN
0167-8019
DOI
10.1007/s10440-008-9254-y
language
English
LU publication?
yes
id
38a163af-6d73-4365-afb5-d8fdf3224668 (old id 2799119)
date added to LUP
2016-04-01 13:52:42
date last changed
2022-03-29 17:55:18
@article{38a163af-6d73-4365-afb5-d8fdf3224668,
  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.}},
  author       = {{Andersson, F. K. and Silvestrov, Sergei}},
  issn         = {{0167-8019}},
  keywords     = {{citation ranking; PageRank; search engines; information retrieval; text; indexing; ranking; Markov chains; power method; power series}},
  language     = {{eng}},
  number       = {{2}},
  pages        = {{211--242}},
  publisher    = {{Springer}},
  series       = {{Acta Applicandae Mathematicae}},
  title        = {{The mathematics of internet search engines}},
  url          = {{http://dx.doi.org/10.1007/s10440-008-9254-y}},
  doi          = {{10.1007/s10440-008-9254-y}},
  volume       = {{104}},
  year         = {{2008}},
}