{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T01:39:30Z","timestamp":1767922770702,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,6]]},"DOI":"10.1145\/1148170.1148225","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"308-315","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["Generalizing PageRank"],"prefix":"10.1145","author":[{"given":"Ricardo","family":"Baeza-Yates","sequence":"first","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain & Santiago, Chile"}]},{"given":"Paolo","family":"Boldi","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Milano, Milan, Italy"}]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Roma \"La Sapienza, Rome, Italy"}]}],"member":"320","published-online":{"date-parts":[[2006,8,6]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"130","volume":"401","author":"Albert R.","year":"1999","unstructured":"R. Albert , H. Jeong , and A. L. Barab\u00e1si . Diameter of the World Wide Web. Nature , 401 : 130 -- 131 , 1999 . R. Albert, H. Jeong, and A. L. Barab\u00e1si. Diameter of the World Wide Web. Nature, 401:130--131, 1999.","journal-title":"Diameter of the World Wide Web. Nature"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/383034.383035"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1013367.1013459"},{"key":"e_1_3_2_1_4_1","volume-title":"Modern Information Retrieval","author":"Baeza-Yates R.","year":"1999","unstructured":"R. Baeza-Yates and B. Ribeiro-Neto . Modern Information Retrieval . Addison Wesley , 1999 . R. Baeza-Yates and B. Ribeiro-Neto. Modern Information Retrieval. Addison Wesley, 1999."},{"key":"e_1_3_2_1_5_1","volume-title":"Dynamically-Evolving Large-Scale Inf. Sys.","author":"Becchetti L.","year":"2006","unstructured":"L. Becchetti , C. Castillo , D. Donato , S. Leonardi and R. Baeza-Yates . Using rank propagation and probabilistic counting for link-based spam detection. Tech. report DELIS-TR-0341 , Dynamically-Evolving Large-Scale Inf. Sys. 2006 . L. Becchetti, C. Castillo, D. Donato, S. Leonardi and R. Baeza-Yates. Using rank propagation and probabilistic counting for link-based spam detection. Tech. report DELIS-TR-0341, Dynamically-Evolving Large-Scale Inf. Sys. 2006."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/290941.290972"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062787"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060827"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-004-0002-2"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151087.1151090"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031171.1031248"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/aama.2001.0720"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345597"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988714"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"D.\n      Fogaras\n    .\n  Where to start browsing the Web? In IICS vol. \n  2877\n   of \n  Springer LNCS pp. \n  65\n  --\n  79 Leipzig Germany 2003\n  .  D. Fogaras. Where to start browsing the Web? In IICS vol. 2877 of Springer LNCS pp. 65--79 Leipzig Germany 2003.","DOI":"10.1007\/978-3-540-39884-4_6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1062745.1062789"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/276675.276686"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_3_2_1_21_1","volume-title":"Proc. of IRAL","author":"Joo W.-K.","year":"1998","unstructured":"W.-K. Joo and S. H. Myaeng . Improving retrieval effectiveness with hyperlink information . In Proc. of IRAL , Singapore , 1998 . W.-K. Joo and S. H. Myaeng. Improving retrieval effectiveness with hyperlink information. In Proc. of IRAL, Singapore, 1998."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289026"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_1_24_1","first-page":"57","volume-title":"Proc. of FOCS","author":"Kumar R.","year":"2000","unstructured":"R. Kumar , P. Raghavan , S. Rajagopalan , D. Sivakumar , A. Tomkins , and E. Upfal . Stochastic models for the Web graph . In Proc. of FOCS , pp. 57 -- 65 , Redondo Beach, USA , 2000 . IEEE CS Press . R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal. Stochastic models for the Web graph. In Proc. of FOCS, pp. 57--65, Redondo Beach, USA, 2000. IEEE CS Press."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/4236.707687"},{"key":"e_1_3_2_1_26_1","first-page":"143","volume-title":"Proc. of the Int. Conf. on Internet Computing","author":"Lifantsev M.","year":"2000","unstructured":"M. Lifantsev . Voting model for ranking Web pages . In Proc. of the Int. Conf. on Internet Computing , pp. 143 -- 148 , Las Vegas, Nevada, USA , 2000 . M. Lifantsev. Voting model for ranking Web pages. In Proc. of the Int. Conf. on Internet Computing, pp. 143--148, Las Vegas, Nevada, USA, 2000."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/WI.2005.161"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/283554.283403"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.20081"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.026118"},{"key":"e_1_3_2_1_31_1","volume-title":"The PageRank citation ranking: bringing order to the Web. Tech. report","author":"Page L.","year":"1998","unstructured":"L. Page , S. Brin , R. Motwani , and T. Winograd . The PageRank citation ranking: bringing order to the Web. Tech. report , Stanford University , 1998 . L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: bringing order to the Web. Tech. report, Stanford University, 1998."},{"key":"e_1_3_2_1_32_1","series-title":"LNCS","first-page":"330","volume-title":"Proc. of COCOON","author":"Pandurangan G.","year":"2002","unstructured":"G. Pandurangan , P. Raghavan , and E. Upfal . Using Pagerank to characterize Web structure . In Proc. of COCOON , vol. 2387 of LNCS , pp. 330 -- 390 , Singapore, 2002 . Springer . G. Pandurangan, P. Raghavan, and E. Upfal. Using Pagerank to characterize Web structure. In Proc. of COCOON, vol. 2387 of LNCS, pp. 330--390, Singapore, 2002. Springer."},{"key":"e_1_3_2_1_33_1","volume-title":"McGraw-Hill","author":"Rudin W.","year":"1986","unstructured":"W. Rudin . Real and Complex Analysis . McGraw-Hill , May 1986 . W. Rudin. Real and Complex Analysis. McGraw-Hill, May 1986."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10791-005-6993-5"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2004.01.030"}],"event":{"name":"SIGIR06: The 29th Annual International SIGIR Conference","location":"Seattle Washington USA","acronym":"SIGIR06","sponsor":["ACM Association for Computing Machinery","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1148170.1148225","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T11:12:11Z","timestamp":1673349131000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1148170.1148225"}},"subtitle":["damping functions for link-based ranking algorithms"],"short-title":[],"issued":{"date-parts":[[2006,8,6]]},"references-count":34,"alternative-id":["10.1145\/1148170.1148225","10.1145\/1148170"],"URL":"https:\/\/doi.org\/10.1145\/1148170.1148225","relation":{},"subject":[],"published":{"date-parts":[[2006,8,6]]},"assertion":[{"value":"2006-08-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}