{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T21:12:55Z","timestamp":1725570775714},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642180088"},{"type":"electronic","value":"9783642180095"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-18009-5_13","type":"book-chapter","created":{"date-parts":[[2010,12,2]],"date-time":"2010-12-02T10:31:28Z","timestamp":1291285888000},"page":"132-145","source":"Crossref","is-referenced-by-count":8,"title":["Fast Katz and Commuters: Efficient Estimation of Social Relatedness in Large Networks"],"prefix":"10.1007","author":[{"given":"Pooya","family":"Esfandiar","sequence":"first","affiliation":[]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[]},{"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Greif","sequence":"additional","affiliation":[]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[]},{"given":"Byung-Won","family":"On","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1109\/ICDMW.2009.54","volume-title":"Proceedings of the 2009 IEEE International Conference on Data Mining Workshops, ICDMW 2009","author":"E. Acar","year":"2009","unstructured":"Acar, E., Dunlavy, D.M., Kolda, T.G.: Link prediction on evolving data using matrix and tensor factorizations. In: Proceedings of the 2009 IEEE International Conference on Data Mining Workshops, ICDMW 2009, pp. 262\u2013269. IEEE Computer Society, Los Alamitos (2009)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Andersen, R., Chung, F., Lang, K.: Local graph partitioning using PageRank vectors. In: Proc. of the 47th Annual IEEE Sym. on Found. of Comp. Sci. (2006)","DOI":"10.1109\/FOCS.2006.44"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1080\/15427951.2006.10129116","volume":"3","author":"P. Berkhin","year":"2007","unstructured":"Berkhin, P.: Bookmark-coloring algorithm for personalized PageRank computing. Internet Math.\u00a03(1), 41\u201362 (2007)","journal-title":"Internet Math."},{"issue":"4","key":"13_CR4","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1023\/A:1013470632383","volume":"7","author":"K.C. Foster","year":"2001","unstructured":"Foster, K.C., Muth, S.Q., Potterat, J.J., Rothenberg, R.B.: A faster Katz status score algorithm. Comput. & Math. Organ. Theo.\u00a07(4), 275\u2013285 (2001)","journal-title":"Comput. & Math. Organ. Theo."},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1109\/TKDE.2007.46","volume":"19","author":"F. Fouss","year":"2007","unstructured":"Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng.\u00a019(3), 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-4149(74)90001-5","volume":"2","author":"F. G\u00f6bel","year":"1974","unstructured":"G\u00f6bel, F., Jagers, A.A.: Random walks on graphs. Stochastic Processes and their Applications\u00a02(4), 311\u2013336 (1974)","journal-title":"Stochastic Processes and their Applications"},{"key":"13_CR7","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1996","unstructured":"Golub, G.H., Loan, C.F.V.: Matrix Computations, 3rd edn. Johns Hopkins Univ. Press, Baltimore (1996)","edition":"3"},{"key":"13_CR8","series-title":"Pitman Res. Notes Math. Ser.","first-page":"105","volume-title":"Numerical analysis 1993 (Dundee, 1993)","author":"G.H. Golub","year":"1994","unstructured":"Golub, G.H., Meurant, G.: Matrices, moments and quadrature. In: Numerical analysis 1993 (Dundee, 1993). Pitman Res. Notes Math. Ser., vol.\u00a0303, pp. 105\u2013156. Longman Sci. Tech., Harlow (1994)"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/BF02510247","volume":"37","author":"G.H. Golub","year":"1997","unstructured":"Golub, G.H., Meurant, G.: Matrices, moments and quadrature ii; how to compute the norm of the error in iterative methods. BIT Num. Math.\u00a037(3), 687\u2013705 (1997)","journal-title":"BIT Num. Math."},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1145\/775152.775191","volume-title":"Proceedings of the 12th International Conference on the World Wide Web","author":"G. Jeh","year":"2003","unstructured":"Jeh, G., Widom, J.: Scaling personalized web search. In: Proceedings of the 12th International Conference on the World Wide Web, pp. 271\u2013279. ACM, New York (2003)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/BF02289026","volume":"18","author":"L. Katz","year":"1953","unstructured":"Katz, L.: A new status index derived from sociometric analysis. Psychometrika\u00a018, 39\u201343 (1953)","journal-title":"Psychometrika"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Li, P., Liu, H., Yu, J.X., He, J., Du, X.: Fast single-pair simrank computation. In: Proc. of the SIAM Intl. Conf. on Data Mining (SDM 2010), Columbus, OH (2010)","DOI":"10.1137\/1.9781611972801.50"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Liben-Nowell, D., Kleinberg, J.M.: The link prediction problem for social networks. In: Proc. of the ACM Intl. Conf. on Inform. and Knowlg. Manage. CIKM 2003 (2003)","DOI":"10.1145\/956863.956972"},{"key":"13_CR14","first-page":"575","volume-title":"Proc. of the 14th Intl. Conf. on the WWW","author":"F. McSherry","year":"2005","unstructured":"McSherry, F.: A uniform approach to accelerated PageRank computation. In: Proc. of the 14th Intl. Conf. on the WWW, pp. 575\u2013582. ACM Press, New York (2005)"},{"key":"13_CR15","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: Bringing order to the web. Technical Report 1999-66, Stanford University (November 1999)"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11556121_17","volume-title":"Computer Analysis of Images and Patterns","author":"H. Qiu","year":"2005","unstructured":"Qiu, H., Hancock, E.R.: Commute times for graph spectral clustering. In: Gagalowicz, A., Philips, W. (eds.) CAIP 2005. LNCS, vol.\u00a03691, pp. 128\u2013136. Springer, Heidelberg (2005)"},{"issue":"11","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1873","DOI":"10.1109\/TPAMI.2007.1103","volume":"29","author":"H. Qiu","year":"2007","unstructured":"Qiu, H., Hancock, E.R.: Clustering and embedding using commute times. IEEE Trans. Pattern Anal. Mach. Intell.\u00a029(11), 1873\u20131890 (2007)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/1117454.1117460","volume":"7","author":"M.J. Rattigan","year":"2005","unstructured":"Rattigan, M.J., Jensen, D.: The case for anomalous link discovery. SIGKDD Explor. Newsl.\u00a07(2), 41\u201347 (2005)","journal-title":"SIGKDD Explor. Newsl."},{"key":"13_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-30115-8_35","volume-title":"Machine Learning: ECML 2004","author":"M. Saerens","year":"2004","unstructured":"Saerens, M., Fouss, F., Yen, L., Dupont, P.: The principal components analysis of a graph, and its relationships to spectral clustering. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol.\u00a03201, pp. 371\u2013383. Springer, Heidelberg (2004)"},{"key":"13_CR20","unstructured":"Sarkar, P., Moore, A.W.: A tractable approach to finding closest truncated-commute-time neighbors in large graphs. In: Proc. of the 23rd Conf. on Uncert. in Art. Intell., UAI 2007 (2007)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Moore, A.W., Prakash, A.: Fast incremental proximity search in large graphs. In: Proc. of the 25th Intl. Conf. on Mach. Learn., ICML 2008 (2008)","DOI":"10.1145\/1390156.1390269"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. In: Proc. of the 40th Ann. ACM Symp. on Theo. of Comput. (STOC 2008), pp. 563\u2013568 (2008)","DOI":"10.1145\/1374376.1374456"},{"key":"13_CR23","volume-title":"Matrix Iterative Analysis","author":"R. Varga","year":"1962","unstructured":"Varga, R.: Matrix Iterative Analysis. Prentice-Hall, Englewood Cliffs (1962)"},{"key":"13_CR24","first-page":"322","volume-title":"Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, ICDM 2007","author":"C. Wang","year":"2007","unstructured":"Wang, C., Satuluri, V., Parthasarathy, S.: Local probabilistic models for link prediction. In: Proceedings of the 2007 Seventh IEEE International Conference on Data Mining, ICDM 2007, Washington, DC, USA, pp. 322\u2013331. IEEE Computer Society, Los Alamitos (December 2007)"},{"key":"13_CR25","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1007\/978-3-540-71701-0_117","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"L. Yen","year":"2007","unstructured":"Yen, L., Fouss, F., Decaestecker, C., Francq, P., Saerens, M.: Graph nodes clustering based on the commute-time kernel. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04426, pp. 1037\u20131045. Springer, Heidelberg (2007)"}],"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-642-18009-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,14]],"date-time":"2021-11-14T09:49:20Z","timestamp":1636883360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18009-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642180088","9783642180095"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18009-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}