The effect of the back button in a random walk: application for pagerank

Abstract : Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by Page, Brin et al., is used by the Google search engine to improve the results of the queries. The purpose of this article is to describe an enhanced version of the algorithm using a realistic model for the back button. We introduce a limited history stack model (you cannot click more than m times in a row), and show that when m = 1, the computation of this Back PageRank can be as fast as that of a standard PageRank.
Type de document :
Communication dans un congrès
WWW '04 - Special interest tracks and posters of the 13th international conference on World Wide Web, May 2004, New York, United States. ACM, pp.370-371, 2004, 〈http://www.www2004.org/proceedings/docs/2p370.pdf〉. 〈10.1145/1013367.1013480〉
Liste complète des métadonnées

Littérature citée [5 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00668339
Contributeur : Fabien Mathieu <>
Soumis le : jeudi 9 février 2012 - 16:12:47
Dernière modification le : vendredi 25 mai 2018 - 12:02:03
Document(s) archivé(s) le : jeudi 10 mai 2012 - 02:50:25

Fichier

2p370.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Collections

Citation

Fabien Mathieu, Mohamed Bouklit. The effect of the back button in a random walk: application for pagerank. WWW '04 - Special interest tracks and posters of the 13th international conference on World Wide Web, May 2004, New York, United States. ACM, pp.370-371, 2004, 〈http://www.www2004.org/proceedings/docs/2p370.pdf〉. 〈10.1145/1013367.1013480〉. 〈hal-00668339〉

Partager

Métriques

Consultations de la notice

188

Téléchargements de fichiers

185