{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:52:20Z","timestamp":1775299940467,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030050504","type":"print"},{"value":"9783030050511","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05051-1_41","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T16:38:48Z","timestamp":1544114328000},"page":"593-607","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Method for All-Pair SimRank Similarity Computation"],"prefix":"10.1007","author":[{"given":"Xuan","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingkun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gangshan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"issue":"1","key":"41_CR1","first-page":"408","volume":"1","author":"I Antonellis","year":"2008","unstructured":"Antonellis, I., Garcia-Molina, H., Chang, C.: SimRank++: query rewriting through link analysis of the click graph. PVLDB 1(1), 408\u2013421 (2008)","journal-title":"PVLDB"},{"key":"41_CR2","volume-title":"Modern Information Retrieval","author":"R Baeza-Yates","year":"1999","unstructured":"Baeza-Yates, R., Ribeiro-Neto, B., et al.: Modern Information Retrieval, vol. 463. ACM Press, New York (1999)"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Bhattacharya, I., Getoor, L.: Entity resolution in graphs. In: Mining Graph Data, p. 311 (2006)","DOI":"10.1002\/9780470073049.ch13"},{"issue":"7","key":"41_CR4","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1109\/12.508322","volume":"45","author":"TN Bui","year":"1996","unstructured":"Bui, T.N., Moon, B.R.: Genetic algorithm and graph partitioning. IEEE Trans. Comput. 45(7), 841\u2013855 (1996)","journal-title":"IEEE Trans. Comput."},{"key":"41_CR5","doi-asserted-by":"crossref","unstructured":"Cao, L., Cho, B., Kim, H.D., Li, Z., Tsai, M.H., Gupta, I.: Delta-SimRank computing on MapReduce. In: Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, pp. 28\u201335. ACM (2012)","DOI":"10.1145\/2351316.2351321"},{"key":"41_CR6","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. In: OSDI, pp. 137\u2013150. USENIX Association (2004)"},{"issue":"11","key":"41_CR7","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1016\/S1389-1286(99)00022-5","volume":"31","author":"J Dean","year":"1999","unstructured":"Dean, J., Henzinger, M.R.: Finding related pages in the world wide web. Comput. Netw. 31(11), 1467\u20131479 (1999)","journal-title":"Comput. Netw."},{"issue":"3","key":"41_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/1932409","volume":"26","author":"LR Dice","year":"1945","unstructured":"Dice, L.R.: Measures of the amount of ecologic association between species. Ecology 26(3), 297\u2013302 (1945)","journal-title":"Ecology"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. Papers on Twenty-Five Years of Electronic Design Automation, pp. 241\u2013247. ACM (1988)","DOI":"10.1145\/62882.62910"},{"issue":"3","key":"41_CR10","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. 19(3), 355\u2013369 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"41_CR11","doi-asserted-by":"crossref","unstructured":"He, G., Feng, H., Li, C., Chen, H.: Parallel SimRank computation on large graphs with iterative aggregation. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 543\u2013552. ACM (2010)","DOI":"10.1145\/1835804.1835874"},{"issue":"2","key":"41_CR12","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson, B., Leland, R.W.: An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J. Sci. Comput. 16(2), 452\u2013469 (1995)","journal-title":"SIAM J. Sci. Comput."},{"key":"41_CR13","unstructured":"Jaccard, P.: Etude comparative de la distribution florale dans uneportion des Alpes et du Jura. Impr. Corbaz (1901)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"Jeh, G., Widom, J.: SimRank: a measure of structural-context similarity. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 538\u2013543. ACM (2002)","DOI":"10.1145\/775047.775126"},{"issue":"6","key":"41_CR15","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"DS Johnson","year":"1989","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part I, graph partitioning. Oper. Res. 37(6), 865\u2013892 (1989)","journal-title":"Oper. Res."},{"key":"41_CR16","unstructured":"Kamvar, S., Haveliwala, T., Manning, C., Golub, G.: Exploiting the block structure of the web for computing PageRank. Technical report 2003-17, Stanford InfoLab (2003)"},{"key":"41_CR17","unstructured":"Karypis, G., Kumar, V.: METIS - unstructured graph partitioning and sparse matrix ordering system, version 2.0. Technical report (1995)"},{"key":"41_CR18","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801","volume-title":"Finding Groups in Data: An Introduction to Cluster Analysis","author":"L Kaufman","year":"1990","unstructured":"Kaufman, L., Rousseeuw, P.: Finding Groups in Data: An Introduction to Cluster Analysis. Wiley, Hoboken (1990)"},{"issue":"2","key":"41_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"41_CR20","doi-asserted-by":"crossref","unstructured":"Kusumoto, M., Maehara, T., Kawarabayashi, K.I.: Scalable similarity search for SimRank. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 325\u2013336. ACM (2014)","DOI":"10.1145\/2588555.2610526"},{"key":"41_CR21","doi-asserted-by":"crossref","unstructured":"Li, C., et al.: Fast computation of SimRank for static and dynamic information networks. In: Proceedings of the 13th International Conference on Extending Database Technology, pp. 465\u2013476. ACM (2010)","DOI":"10.1145\/1739041.1739098"},{"key":"41_CR22","doi-asserted-by":"crossref","unstructured":"Li, L., Li, C., Chen, H., Du, X.: MapReduce-based SimRank computation and its application in social recommender system. In: BigData Congress, pp. 133\u2013140. IEEE Computer Society (2013)","DOI":"10.1109\/BigData.Congress.2013.26"},{"issue":"1","key":"41_CR23","first-page":"24","volume":"9","author":"Z Li","year":"2015","unstructured":"Li, Z., Fang, Y., Liu, Q., Cheng, J., Cheng, R., Lui, J.C.S.: Walking in the cloud: parallel SimRank at scale. PVLDB 9(1), 24\u201335 (2015)","journal-title":"PVLDB"},{"issue":"1","key":"41_CR24","doi-asserted-by":"publisher","first-page":"422","DOI":"10.14778\/1453856.1453904","volume":"1","author":"D Lizorkin","year":"2008","unstructured":"Lizorkin, D., Velikhov, P., Grinev, M., Turdakov, D.: Accuracy estimate and optimization techniques for SimRank computation. Proc. VLDB Endow. 1(1), 422\u2013433 (2008)","journal-title":"Proc. VLDB Endow."},{"key":"41_CR25","doi-asserted-by":"crossref","unstructured":"Maehara, T., Kusumoto, M., Kawarabayashi, K.: Efficient SimRank computation via linearization. CoRR abs\/1411.7228 (2014)","DOI":"10.1145\/2623330.2623696"},{"issue":"23","key":"41_CR26","doi-asserted-by":"publisher","first-page":"8577","DOI":"10.1073\/pnas.0601602103","volume":"103","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Modularity and community structure in networks. Proc. Nat. Acad. Sci. 103(23), 8577\u20138582 (2006)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"41_CR27","unstructured":"Page, L., Brin, S., Motwani, R., Winograd, T.: The PageRank citation ranking: bringing order to the web (1999)"},{"key":"41_CR28","doi-asserted-by":"crossref","unstructured":"Rothe, S., Sch\u00fctze, H.: CoSimRank: a flexible & efficient graph-theoretic similarity measure. In: ACL (1), pp. 1392\u20131402. The Association for Computer Linguistics (2014)","DOI":"10.3115\/v1\/P14-1131"},{"key":"41_CR29","doi-asserted-by":"crossref","unstructured":"Yu, W., Lin, X., Zhang, W.: Towards efficient SimRank computation on large networks. In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 601\u2013612. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544859"},{"issue":"3","key":"41_CR30","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 15(3), 327\u2013353 (2012)","journal-title":"World Wide Web"},{"key":"41_CR31","unstructured":"Zaharia, M., Chowdhury, M., Franklin, M.J., Shenker, S., Stoica, I.: Spark: cluster computing with working sets. In: HotCloud. USENIX Association (2010)"},{"key":"41_CR32","doi-asserted-by":"crossref","unstructured":"Zhao, P., Han, J., Sun, Y.: P-rank: a comprehensive structural similarity measure over information networks. In: CIKM, pp. 553\u2013562. ACM (2009)","DOI":"10.1145\/1645953.1646025"},{"key":"41_CR33","doi-asserted-by":"crossref","unstructured":"Zhu, R., Zou, Z., Li, J.: SimRank computation on uncertain graphs. In: ICDE, pp. 565\u2013576. IEEE Computer Society (2016)","DOI":"10.1109\/ICDE.2016.7498271"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05051-1_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:53:27Z","timestamp":1775296407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05051-1_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050504","9783030050511"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05051-1_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"7 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}