{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,16]],"date-time":"2025-12-16T12:12:27Z","timestamp":1765887147357,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642028816"},{"type":"electronic","value":"9783642028823"}],"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-642-02882-3_35","type":"book-chapter","created":{"date-parts":[[2009,7,10]],"date-time":"2009-07-10T10:49:21Z","timestamp":1247222961000},"page":"348-357","source":"Crossref","is-referenced-by-count":2,"title":["HITS Can Converge Slowly, but Not Too Slowly, in Score and Rank"],"prefix":"10.1007","author":[{"given":"Enoch","family":"Peserico","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Pretto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10791-005-5660-1","volume":"8","author":"M. Agosti","year":"2005","unstructured":"Agosti, M., Pretto, L.: A theoretical study of a generalized version of Kleinberg\u2019s HITS algorithm. Information Retrieval\u00a08, 219\u2013243 (2005)","journal-title":"Information Retrieval"},{"issue":"1","key":"35_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.ipm.2004.04.006","volume":"41","author":"M. Bacchin","year":"2005","unstructured":"Bacchin, M., Ferro, N., Melucci, M.: A probabilistic model for stemmer generation. Information Processing and Management\u00a041(1), 121\u2013137 (2005)","journal-title":"Information Processing and Management"},{"key":"35_CR3","unstructured":"Berry, M. (ed.): Survey of Text Mining: Clustering, Classification, and Retrieval. Springer, Heidelberg (2004)"},{"issue":"1-7","key":"35_CR4","first-page":"161","volume":"30","author":"J. Cho","year":"1998","unstructured":"Cho, J., Garcia-Molina, H., Page, L.: Efficient crawling through URL ordering. Computer Networks\u00a030(1-7), 161\u2013172 (1998)","journal-title":"Computer Networks"},{"key":"35_CR5","unstructured":"Fagin, R., Kumar, R., Sivakumar, D.: Comparing top k lists. In: Proc. of ACM-SIAM SODA, pp. 28\u201336 (2003)"},{"issue":"4","key":"35_CR6","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1137\/S1064827502412875","volume":"27","author":"A. Farahat","year":"2006","unstructured":"Farahat, A., Lofaro, T., Miller, J., Rae, G., Ward, L.: Authority rankings from HITS, PageRank and SALSA: Existence, uniqueness and effect of initialization. SIAM Journal on Scientific Computing\u00a027(4), 1181\u20131201 (2006)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"35_CR7","unstructured":"Golub, G., Van Loan, C.: Matrix Computations, 3rd edn. Johns Hopkins Univ. Press (1996)"},{"key":"35_CR8","unstructured":"Haveliwala, T.: Efficient computation of PageRank. Tech. rep., Stanford Un. (1999)"},{"issue":"4","key":"35_CR9","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1142\/S0129054104002662","volume":"15","author":"D. Hong","year":"2004","unstructured":"Hong, D., Man, S.: Analysis of Web search algorithm HITS. International Journal of Foundations of Computer Science\u00a015(4), 649\u2013662 (2004)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"35_CR10","doi-asserted-by":"crossref","unstructured":"Jurczyk, P., Agichtein, E.: HITS on question answer portals: Exploration of link analysis for author ranking. In: Proc. of ACM SIGIR, pp. 845\u2013846 (2007)","DOI":"10.1145\/1277741.1277938"},{"issue":"5","key":"35_CR11","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1145\/324133.324140","volume":"46","author":"J. Kleinberg","year":"1999","unstructured":"Kleinberg, J.: Authoritative sources in a hyperlinked environment. JACM\u00a046(5), 604\u2013632 (1999)","journal-title":"JACM"},{"key":"35_CR12","unstructured":"Knuth, D.: The Art of Computer Programming, 3rd edn., vol.\u00a02, sec. 4.6.3. Addison-Wesley, Reading (1998)"},{"key":"35_CR13","doi-asserted-by":"crossref","unstructured":"Kumar, S., Haveliwala, T., Manning, C., Golub, G.: Extrapolation methods for accelerating PageRank computations. In: Proc. of WWW, pp. 261\u2013270 (2003)","DOI":"10.1145\/775152.775190"},{"key":"35_CR14","doi-asserted-by":"crossref","unstructured":"Kurland, O., Lee, L.: PageRank without hyperlinks: Structural re-ranking using links induced by language models. In: Proc. of ACM SIGIR, pp. 306\u2013313 (2005)","DOI":"10.1145\/1076034.1076087"},{"key":"35_CR15","doi-asserted-by":"crossref","unstructured":"Kurland, O., Lee, L.: Respect my authority! HITS without hyperlinks, utilizing cluster-based language models. In: Proc. of ACM SIGIR, pp. 83\u201390 (2006)","DOI":"10.1145\/1148170.1148188"},{"key":"35_CR16","doi-asserted-by":"crossref","unstructured":"Langville, A., Meyer, C.: Google\u2019s PageRank and Beyond: The Science of Search Engine Rankings. Princeton University Press, Princeton (2006)","DOI":"10.1515\/9781400830329"},{"issue":"2","key":"35_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/382979.383041","volume":"19","author":"R. Lempel","year":"2001","unstructured":"Lempel, R., Moran, S.: SALSA: The stochastic approach for link-structure analysis. ACM Transactions on Information Systems\u00a019(2), 131\u2013160 (2001)","journal-title":"ACM Transactions on Information Systems"},{"key":"35_CR18","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10791-005-5661-0","volume":"8","author":"R. Lempel","year":"2005","unstructured":"Lempel, R., Moran, S.: Rank-stability and rank-similarity of link-based Web ranking algorithms in authority-connected graphs. Information Retrieval\u00a08, 219\u2013243 (2005)","journal-title":"Information Retrieval"},{"key":"35_CR19","doi-asserted-by":"crossref","unstructured":"Mizzaro, S., Robertson, S.: HITS hits TREC - exploring IR evaluation results with network analysis. In: Proc. of ACM SIGIR, pp. 479\u2013486 (2007)","DOI":"10.1145\/1277741.1277824"},{"key":"35_CR20","unstructured":"Peserico, E., Pretto, L.: What does it mean to converge in rank? In: Proc. of ICTIR, pp. 239\u2013245 (2007)"},{"key":"35_CR21","doi-asserted-by":"crossref","unstructured":"Peserico, E., Pretto, L.: The rank convergence of HITS can be slow. CoRR, abs\/0807.3006 (2008)","DOI":"10.1145\/1571941.1572120"},{"key":"35_CR22","unstructured":"Peserico, E., Pretto, L.: HITS can converge slowly, but not too slowly, in score and rank, http:\/\/www.dei.unipd.it\/~pretto\/cocoon\/hits_convergence.pdf"},{"key":"35_CR23","doi-asserted-by":"crossref","unstructured":"Wang, K., Su, M.-Y.: Item selection by \u201dhub-authority\u201d profit ranking. In: Proc. of ACM SIGKDD, pp. 652\u2013657 (2002)","DOI":"10.1145\/775047.775144"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02882-3_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,10]],"date-time":"2025-02-10T21:58:53Z","timestamp":1739224733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02882-3_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642028816","9783642028823"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02882-3_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}