BackRank: an Alternative for PageRank?

Abstract : This paper proposes to extend a previous work, "The Effect of the Back Button in a Random Walk: Application for PageRank". We introduce an enhanced version of the PageRank algorithm using a realistic model for the Back button, thus improving the random surfer model. We show that in the special case where the history is bound to an unique page (you cannot use the Back button twice in a row), we can produce an algorithm that does not need much more resources than a standard PageRank. This algorithm, BackRank, can converge up to 30% faster than a standard PageRank and suppress most of the drawbacks induced by the existence of pages without links.
Type de document :
Communication dans un congrès
WWW '05 - Special interest tracks and posters of the 14th international conference on World Wide Web, 2005, Chiba, Japan. ACM, pp.1122-1123, 2005, 〈http://www2005.org/cdrom/docs/p1122.pdf〉. 〈10.1145/1062745.1062899〉
Liste complète des métadonnées

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

https://hal.inria.fr/hal-00666281
Contributeur : Fabien Mathieu <>
Soumis le : lundi 6 février 2012 - 10:40:40
Dernière modification le : vendredi 25 mai 2018 - 12:02:03
Document(s) archivé(s) le : lundi 7 mai 2012 - 02:20:51

Fichier

p1122.pdf
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

Citation

Mohamed Bouklit, Fabien Mathieu. BackRank: an Alternative for PageRank?. WWW '05 - Special interest tracks and posters of the 14th international conference on World Wide Web, 2005, Chiba, Japan. ACM, pp.1122-1123, 2005, 〈http://www2005.org/cdrom/docs/p1122.pdf〉. 〈10.1145/1062745.1062899〉. 〈hal-00666281〉

Partager

Métriques

Consultations de la notice

473

Téléchargements de fichiers

322