| Title | The mathematics of internet search engines |
| Authors | F. K. Andersson, Sergei Silvestrov |
| Alternative Location | http://dx.doi.org/10.1007/s..., Restricted Access |
| Publication | Acta Applicandae Mathematicae |
| Year | 2008 |
| Volume | 104 |
| Issue | 2 |
| Pages | 211 - 242 |
| Document type | Article |
| Status | Published |
| Quality controlled | Yes |
| Language | eng |
| Publisher | Springer |
| Abstract English | 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. |
| Keywords | citation ranking, PageRank, search engines, information retrieval, text, indexing, ranking, Markov chains, power method, power series, |
| ISBN/ISSN/Other | ISSN: 0167-8019 |
Questions: webmaster
Last update: 2013-04-11
Centre for Mathematical Sciences, Box 118, SE-22100, Lund. Telefon: +46 46-222 00 00 (vx)