{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:29Z","timestamp":1725558989443},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142451"},{"type":"electronic","value":"9783642142468"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14246-8_29","type":"book-chapter","created":{"date-parts":[[2010,7,6]],"date-time":"2010-07-06T14:09:26Z","timestamp":1278425366000},"page":"280-296","source":"Crossref","is-referenced-by-count":9,"title":["Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs"],"prefix":"10.1007","author":[{"given":"Weiren","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiajin","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M., Turdakov, D.: Accuracy estimate and optimization techniques for simrank computation. PVLDB\u00a01(1) (2008)","DOI":"10.14778\/1453856.1453904"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: Simrank: a measure of structural-context similarity. In: KDD (2002)","DOI":"10.1145\/775047.775126"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Fogaras, D., R\u00e1cz, B.: Scaling link-based similarity search. In: WWW (2005)","DOI":"10.1145\/1060745.1060839"},{"key":"29_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., Mesiti, M., T\u00fcrker, C., Tzitzikas, Y., Vakali, A.I. (eds.) EDBT 2004. LNCS, vol.\u00a03268, pp. 557\u2013567. Springer, Heidelberg (2004)"},{"key":"29_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-540-88192-6_30","volume-title":"Advanced Data Mining and Applications","author":"Y. Cai","year":"2008","unstructured":"Cai, Y., Li, P., Liu, H., He, J., Du, X.: S-simrank: Combining content and link information to cluster papers effectively and efficiently. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds.) ADMA 2008. LNCS (LNAI), vol.\u00a05139, pp. 317\u2013329. Springer, Heidelberg (2008)"},{"key":"29_CR6","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":"29_CR7","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Le, J.: A space and time efficient algorithm for simrank computation. In: APWeb (2010)","DOI":"10.1109\/APWeb.2010.42"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Weinberg, B.H.: Bibliographic coupling: A review. Information Storage and Retrieval\u00a010(5-6) (1974)","DOI":"10.1016\/0020-0271(74)90058-8"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Wijaya, D.T., Bressan, S.: Clustering web documents using co-citation, coupling, incoming, and outgoing hyperlinks: a comparative performance analysis of algorithms. IJWIS\u00a02(2) (2006)","DOI":"10.1108\/17440080680000102"},{"key":"29_CR10","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":"29_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0653-8","volume-title":"Matrix Analysis","author":"R. Bhatia","year":"1997","unstructured":"Bhatia, R.: Matrix Analysis. Springer, Heidelberg (1997)"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Hernandez, V., Roman, J.E., Vidal, V.: Slepc: A scalable and flexible toolkit for the solution of eigenvalue problems. ACM Trans. Math. Softw.\u00a031(3) (2005)","DOI":"10.1145\/1089014.1089019"},{"key":"29_CR13","unstructured":"Maschhoff, K.J., Sorensen, D.C.: A portable implementation of arpack for distributed memory parallel architectures. In: CMCIM (1996)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Wu, K., Simon, H.: A parallel lanczos method for symmetric generalized eigenvalue problems. Technical report, Lawrence Berkeley National Laboratory (1997)","DOI":"10.2172\/10163130"},{"key":"29_CR15","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The pagerank citation ranking bringing order to the web, Technial report (1998)"},{"key":"29_CR16","unstructured":"Mendelzon, A.O.: Review - authoritative sources in a hyperlinked environment. ACM SIGMOD Digital Review\u00a01 (2000)"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Wang, J., Zeng, H., Chen, Z., Lu, H., Tao, L., Ma, W.: Recom: reinforcement clustering of multi-type interrelated data objects. In: SIGIR (2003)","DOI":"10.1145\/860435.860486"},{"key":"29_CR18","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":"29_CR19","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: CIKM 2009: Proceeding of the 18th ACM conference on Information and knowledge management (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"29_CR20","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"},{"key":"29_CR21","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)"}],"container-title":["Lecture Notes in Computer Science","Web-Age Information Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14246-8_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:49:48Z","timestamp":1606186188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14246-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142451","9783642142468"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14246-8_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}