{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:11:02Z","timestamp":1725516662618},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642312342"},{"type":"electronic","value":"9783642312359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31235-9_15","type":"book-chapter","created":{"date-parts":[[2012,6,14]],"date-time":"2012-06-14T12:12:45Z","timestamp":1339675965000},"page":"231-249","source":"Crossref","is-referenced-by-count":3,"title":["On the Efficiency of Estimating Penetrating Rank on Large Graphs"],"prefix":"10.1007","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajin","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Antonellis, I., Garcia-Molina, H., Chang, C.-C.: SimRank++: query rewriting through link analysis of the click graph. PVLDB\u00a01(1) (2008)","DOI":"10.14778\/1453856.1453903"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Cai, Y., Zhang, M., Ding, C.H.Q., Chakravarthy, S.: Closed form solution of similarity algorithms. In: SIGIR, pp. 709\u2013710 (2010)","DOI":"10.1145\/1835449.1835577"},{"key":"15_CR3","unstructured":"Cowell, W.R. (ed.): Sources and Development of Mathematical Software. Prentice-Hall Series in Computational Mathematics, Cleve Moler, Advisor (1984)"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30192-9_55","volume-title":"Current Trends in Database Technology - EDBT 2004 Workshops","author":"D. Fogaras","year":"2004","unstructured":"Fogaras, D., R\u00e1cz, B.: A Scalable Randomized Method to Compute Link-Based Similarity Rank on the Web Graph. In: Lindner, W., Fischer, F., T\u00fcrker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol.\u00a03268, pp. 557\u2013567. Springer, Heidelberg (2004)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: WWW (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. In: KDD (2010)","DOI":"10.1145\/1835804.1835874"},{"key":"15_CR7","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press (February 1990)"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/582415.582418","volume":"20","author":"K. J\u00e4rvelin","year":"2002","unstructured":"J\u00e4rvelin, K., Kek\u00e4l\u00e4inen, J.: Cumulated gain-based evaluation of IR techniques. ACM Trans. Inf. Syst.\u00a020, 422\u2013446 (2002)","journal-title":"ACM Trans. Inf. Syst."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: KDD, pp. 538\u2013543 (2002)","DOI":"10.1145\/775047.775126"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Kallenberg, O.: Foundations of Modern Probability. Springer (January 2002)","DOI":"10.1007\/978-1-4757-4015-8"},{"key":"15_CR11","unstructured":"Latuszynski, K., Miasojedow, B., Niemiro, W.: Nonasymptotic bounds on the estimation error for regenerative MCMC algorithms. Technical report (2009)"},{"key":"15_CR12","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717907","volume-title":"Matrix Analysis For Scientists And Engineers","author":"A.J. Laub","year":"2004","unstructured":"Laub, A.J.: Matrix Analysis For Scientists And Engineers. Society for Industrial and Applied Mathematics, Philadelphia (2004)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Lee, P., Lakshmanan, L.V.S., Yu, J.X.: On top-k structural similarity search. In: ICDE (2012)","DOI":"10.1109\/ICDE.2012.109"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Huttenlocher, D.P., Kleinberg, J.M.: Signed networks in social media. In: CHI, pp. 1361\u20131370 (2010)","DOI":"10.1145\/1753326.1753532"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., Wu, T.: Fast computation of SimRank for static and dynamic information networks. In: EDBT (2010)","DOI":"10.1145\/1739041.1739098"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-01307-2_36","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"P. Li","year":"2009","unstructured":"Li, P., Cai, Y., Liu, H., He, J., Du, X.: Exploiting the Block Structure of Link Graph for Efficient Similarity Computation. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS, vol.\u00a05476, pp. 389\u2013400. Springer, Heidelberg (2009)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-23535-1_36","volume-title":"Web-Age Information Management","author":"X. Li","year":"2011","unstructured":"Li, X., Yu, W., Yang, B., Le, J.: ASAP: Towards Accurate, Stable and Accelerative Penetrating-Rank Estimation on Large Graphs. In: Wang, H., Li, S., Oyama, S., Hu, X., Qian, T. (eds.) WAIM 2011. LNCS, vol.\u00a06897, pp. 415\u2013429. Springer, Heidelberg (2011)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M.N., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. VLDB J.\u00a019(1) (2010)","DOI":"10.1007\/s00778-009-0168-8"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Saad, Y.: Iterative Methods for Sparse Linear Systems, 2nd edn. Society for Industrial and Applied Mathematics (April 2003)","DOI":"10.1137\/1.9780898718003"},{"key":"15_CR20","unstructured":"Sarma, A.D., Gollapudi, S., Panigrahy, R.: Estimating PageRank on graph streams. In: PODS, pp. 69\u201378 (2008)"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-12116-6_16","volume-title":"Computational Linguistics and Intelligent Text Processing","author":"G. Tsatsaronis","year":"2010","unstructured":"Tsatsaronis, G., Varlamis, I., N\u00f8rv\u00e5g, K.: An Experimental Study on Unsupervised Graph-based Word Sense Disambiguation. In: Gelbukh, A. (ed.) CICLing 2010. LNCS, vol.\u00a06008, pp. 184\u2013198. Springer, Heidelberg (2010)"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Xi, W., Fox, E.A., Fan, W., Zhang, B., Chen, Z., Yan, J., Zhuang, D.: SimFusion: measuring similarity using unified relationship matrix. In: SIGIR (2005)","DOI":"10.1145\/1076034.1076059"},{"key":"15_CR23","series-title":"LNCS","first-page":"231","volume-title":"SSDBM 2012","author":"W. Yu","year":"2012","unstructured":"Yu, W., Le, J., Lin, X., Zhang, W.: On the Efficiency of Estimating Penetrating-Rank on Large Graphs. In: Ailamaki, A., Bowers, S. (eds.) SSDBM 2012. LNCS, vol.\u00a07338, pp. 231\u2013249. Springer, Heidelberg (2012), http:\/\/www.cse.unsw.edu.au\/~weirenyu\/yu-tr-ssdbm2012.pdf"},{"key":"15_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-14246-8_29","volume-title":"Web-Age Information Management","author":"W. Yu","year":"2010","unstructured":"Yu, W., Lin, X., Le, J.: Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs. In: Chen, L., Tang, C., Yang, J., Gao, Y. (eds.) WAIM 2010. LNCS, vol.\u00a06184, pp. 280\u2013296. Springer, Heidelberg (2010)"},{"issue":"3","key":"15_CR25","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s11280-010-0100-6","volume":"15","author":"W. Yu","year":"2012","unstructured":"Yu, W., Zhang, W., Lin, X., Zhang, Q., Le, J.: A space and time efficient algorithm for SimRank computation. World Wide Web\u00a015(3), 327\u2013353 (2012)","journal-title":"World Wide Web"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-Rank: a comprehensive structural similarity measure over information networks. In: CIKM (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Cheng, H., Yu, J.X.: Graph clustering based on structural\/attribute similarities. PVLDB\u00a02(1) (2009)","DOI":"10.14778\/1687627.1687709"}],"container-title":["Lecture Notes in Computer Science","Scientific and Statistical Database Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31235-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,25]],"date-time":"2024-04-25T10:58:49Z","timestamp":1714042729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31235-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642312342","9783642312359"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31235-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}