BackRank: an alternative for PageRank? Export

@inproceedings{citeulike:3477677, abstract = {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.}, address = {New York, NY, USA}, author = {Bouklit, Mohamed and Mathieu, Fabien}, booktitle = {WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web}, citeulike-article-id = {3477677}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1062745.1062899}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1062745.1062899}, citeulike-linkout-2 = {http://www2005.org/cdrom/docs/p1122.pdf}, doi = {10.1145/1062745.1062899}, isbn = {1-59593-051-5}, keywords = {pagerank, personalization}, location = {Chiba, Japan}, pages = {1122--1123}, posted-at = {2008-11-04 06:27:03}, priority = {0}, publisher = {ACM}, title = {BackRank: an alternative for PageRank?}, url = {http://dx.doi.org/10.1145/1062745.1062899}, year = {2005} }

TY - CONF ID - citeulike:3477677 L3 - citeulike-article-id:3477677 N2 - 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. CY - Chiba, Japan SN - 1-59593-051-5 AD - New York, NY, USA EP - 1123 TI - BackRank: an alternative for PageRank? PB - ACM T2 - WWW '05: Special interest tracks and posters of the 14th international conference on World Wide Web SP - 1122 KW - pagerank KW - personalization AU - Bouklit, Mohamed AU - Mathieu, Fabien PY - 2005/// UR - http://dx.doi.org/10.1145/1062745.1062899 ER -