{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:44:06Z","timestamp":1742949846796,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540959946"},{"type":"electronic","value":"9783540959953"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-540-95995-3_7","type":"book-chapter","created":{"date-parts":[[2009,1,29]],"date-time":"2009-01-29T07:33:44Z","timestamp":1233214424000},"page":"76-89","source":"Crossref","is-referenced-by-count":4,"title":["Choose the Damping, Choose the Ranking?"],"prefix":"10.1007","author":[{"given":"Marco","family":"Bressan","sequence":"first","affiliation":[]},{"given":"Enoch","family":"Peserico","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"CiteSeer metadata, http:\/\/citeseer.ist.psu.edu\/oai.html"},{"key":"7_CR2","unstructured":"Avrachenkov, K., Litvak, N., Son Pham, K.: A singular perturbation approach for choosing PageRank damping factor. ArXiv Mathematics e-prints (2006)"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-36227-4_12","volume-title":"Digital Libraries: People, Knowledge, and Technology","author":"M. Bacchin","year":"2002","unstructured":"Bacchin, M., Ferro, N., Melucci, M.: The effectiveness of a graph-based algorithm for stemming. In: Lim, E.-p., Foo, S.S.-B., Khoo, C., Chen, H., Fox, E., Urs, S.R., Costantino, T. (eds.) ICADL 2002. LNCS, vol.\u00a02555, pp. 117\u2013128. Springer, Heidelberg (2002)"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Baeza-Yates, R., Boldi, P., Castillo, C.: Generalizing PageRank: Damping functions for link-based ranking algorithms. In: Proc. ACM SIGIR 2006 (2006)","DOI":"10.1145\/1148170.1148225"},{"key":"7_CR5","volume-title":"Survey of Text Mining","author":"M.W. Berry","year":"2003","unstructured":"Berry, M.W.: Survey of Text Mining. Springer, Heidelberg (2003)"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Boldi, P., Santini, M., Vigna, S.: PageRank as a function of the damping factor. In: Proc. ACM WWW 2005 (2005)","DOI":"10.1145\/1060745.1060827"},{"key":"7_CR7","first-page":"595","volume-title":"Proc. of the Thirteenth International World Wide Web Conference (WWW 2004)","author":"P. Boldi","year":"2004","unstructured":"Boldi, P., Vigna, S.: The WebGraph framework I: Compression techniques. In: Proc. of the Thirteenth International World Wide Web Conference (WWW 2004), Manhattan, USA, pp. 595\u2013601. ACM Press, New York (2004)"},{"issue":"1-7","key":"7_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/S0169-7552(98)00108-1","volume":"30","author":"J. Cho","year":"1998","unstructured":"Cho, J., Garc\u00eda-Molina, H., Page, L.: Efficient crawling through URL ordering. Computer Networks and ISDN Systems\u00a030(1-7), 161\u2013172 (1998)","journal-title":"Computer Networks and ISDN Systems"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1613\/jair.1523","volume":"22","author":"G. Erkan","year":"2004","unstructured":"Erkan, G., Radev, D.R.: Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research\u00a022, 457\u2013479 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proc. ACM SODA (2003)","DOI":"10.1137\/S0895480102412856"},{"key":"7_CR11","unstructured":"Haveliwala, T.H.: Efficient computation of pagerank. Technical report (1999)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-540-30480-7_26","volume-title":"Web Information Systems \u2013 WISE 2004","author":"X.M. Jiang","year":"2004","unstructured":"Jiang, X.M., Xue, G.R., Zeng, H.J., Chen, Z., Song, W.-G., Ma, W.-Y.: Exploiting pageRank at different block level. In: Zhou, X., Su, S., Papazoglou, M.P., Orlowska, M.E., Jeffery, K. (eds.) WISE 2004. LNCS, vol.\u00a03306, pp. 241\u2013252. Springer, Heidelberg (2004)"},{"key":"7_CR13","first-page":"261","volume-title":"Proceedings of WWW","author":"S.D. Kamvar","year":"2003","unstructured":"Kamvar, S.D., Haveliwala, T.H., Manning, C.D., Golub, G.H.: Extrapolation methods for accelerating pagerank computations. In: Proceedings of WWW, pp. 261\u2013270. ACM, New York (2003)"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Kamvar, S.D., Schlosser, M.T., Garcia-Molina, H.: The eigentrust algorithm for reputation management in p2p networks. In: Proc. of ACM WWW 2003(2003)","DOI":"10.1145\/775240.775242"},{"issue":"5","key":"7_CR15","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J.M. Kleinberg","year":"1999","unstructured":"Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. J. ACM\u00a046(5), 604\u2013632 (1999)","journal-title":"J. ACM"},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1080\/15427951.2004.10129091","volume":"1","author":"A.N. Langville","year":"2004","unstructured":"Langville, A.N., Meyer, C.D.: Deeper inside PageRank. Internet Math.\u00a01(3), 335\u2013380 (2004)","journal-title":"Internet Math."},{"key":"7_CR17","doi-asserted-by":"crossref","DOI":"10.1515\/9781400830329","volume-title":"Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings","author":"A.N. Langville","year":"2006","unstructured":"Langville, A.N., Meyer, C.D.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-540-71496-5_54","volume-title":"Advances in Information Retrieval","author":"M. Melucci","year":"2007","unstructured":"Melucci, M., Pretto, L.: PageRank: When order changes. In: Amati, G., Carpineto, C., Romano, G. (eds.) ECiR 2007. LNCS, vol.\u00a04425, pp. 581\u2013588. Springer, Heidelberg (2007)"},{"key":"7_CR19","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Dig. Libr. Tech. Proj. (1998)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Peserico, E., Bressan, M.: Choose the Damping, Choose the Ranking? Technical report, Univ. Padova (2008), http:\/\/www.dei.unipd.it\/~enoch\/papers\/damprank.pdf","DOI":"10.1007\/978-3-540-95995-3_7"},{"key":"7_CR21","unstructured":"Peserico, E., Pretto, L.: What does it mean to converge in rank? In: Proc. ICTIR 2007 (2007)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45735-6_13","volume-title":"String Processing and Information Retrieval","author":"L. Pretto","year":"2002","unstructured":"Pretto, L.: A theoretical analysis of google\u2019s PageRank. In: Laender, A.H.F., Oliveira, A.L. (eds.) SPIRE 2002. LNCS, vol.\u00a02476, pp. 131\u2013144. Springer, Heidelberg (2002)"},{"key":"7_CR23","unstructured":"Chakrabarti, S., Dom, B.E., Gibson, D., Kumar, R., Raghavan, P., Rajagopalan, S., Tomkins, A.: Experiments in topic distillation. In: Proc. ACM SIGIR Workshop on Hypertext IR on the Web (1998)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Tarau, P., Mihalcea, R., Figa, E.: Semantic document engineering with wordnet and PageRank. In: Proc. ACM SAC 2005 (2005)","DOI":"10.1145\/1066677.1066855"},{"key":"7_CR25","unstructured":"University of Milan. Laboratory of Web Algorithmics, http:\/\/law.dsi.unimi.it\/"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Wangk, K.W.: Item selection by \u2019hub-authority\u2019 profit ranking. In: Proc. ACM SIGKDD 2002 (2002)","DOI":"10.1145\/775107.775144"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-95995-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,23]],"date-time":"2023-05-23T20:04:45Z","timestamp":1684872285000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-95995-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783540959946","9783540959953"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-95995-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}