The Mathematics of Internet Search Engines

• Autores: Fredrik Andersson, Sergei D. Silvestrov
• Localización: Acta applicandae mathematicae, ISSN 0167-8019, Vol. 104, Nº. 2, 2008, págs. 211-242
• Idioma: inglés
• DOI: 10.1007/s10440-008-9254-y
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.