The Mathematics of Internet Search Engines

Fredrik Andersson, Sergei Silvestrov

Research output: Contribution to journalArticle

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.
Original languageEnglish
Number of pages39
JournalPreprints in Mathematical Sciences
Issue number10
Publication statusUnpublished - 2007

Subject classification (UKÄ)

  • Mathematics

Free keywords

  • Power series
  • Power method
  • Citation ranking
  • Search engines
  • PageRank
  • Information retrieval
  • Text indexing
  • Markov chains
  • Ranking

Fingerprint

Dive into the research topics of 'The Mathematics of Internet Search Engines'. Together they form a unique fingerprint.

Cite this