{"title":"后退按钮在随机漫步中的效果:应用程序的pagerank","authors":"F. Mathieu, Mohamed Bouklit","doi":"10.1145/1013367.1013480","DOIUrl":null,"url":null,"abstract":"Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by Brin and Page, 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 PageRank algorithm using a realistic model forthe back button. We introduce a limited history stack model (you cannot click more than m times in a row), and showthat when m=1, the computation of this Back PageRank can be as fast as that of a standard PageRank.","PeriodicalId":409891,"journal":{"name":"WWW Alt. '04","volume":"70 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":"{\"title\":\"The effect of the back button in a random walk: application for pagerank\",\"authors\":\"F. Mathieu, Mohamed Bouklit\",\"doi\":\"10.1145/1013367.1013480\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by Brin and Page, 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 PageRank algorithm using a realistic model forthe back button. We introduce a limited history stack model (you cannot click more than m times in a row), and showthat when m=1, the computation of this Back PageRank can be as fast as that of a standard PageRank.\",\"PeriodicalId\":409891,\"journal\":{\"name\":\"WWW Alt. '04\",\"volume\":\"70 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"31\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"WWW Alt. '04\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1013367.1013480\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"WWW Alt. '04","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1013367.1013480","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The effect of the back button in a random walk: application for pagerank
Theoretical analysis of the Web graph is often used to improve the efficiency of search engines. The PageRank algorithm, proposed by Brin and Page, 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 PageRank algorithm using a realistic model forthe back button. We introduce a limited history stack model (you cannot click more than m times in a row), and showthat when m=1, the computation of this Back PageRank can be as fast as that of a standard PageRank.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
