The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Extrapolation methods for accelerating PageRank computations
WWW '03 Proceedings of the 12th international conference on World Wide Web
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
The effect of the back button in a random walk: application for pagerank
Proceedings of the 13th international World Wide Web conference on Alternate track papers & posters
What's in a session: tracking individual behavior on the web
Proceedings of the 20th ACM conference on Hypertext and hypermedia
Stochastic models for tabbed browsing
Proceedings of the 19th international conference on World wide web
Agents, bookmarks and clicks: a topical model of web navigation
Proceedings of the 21st ACM conference on Hypertext and hypermedia
| Hi-index | 0.00 |
This paper proposes to extend a previous work, The Effect of the Back Button in a Random Walk: Application for PageRank [5]. 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.