{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:04:38Z","timestamp":1743105878534,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319930398"},{"type":"electronic","value":"9783319930404"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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-319-93040-4_57","type":"book-chapter","created":{"date-parts":[[2018,6,16]],"date-time":"2018-06-16T13:29:41Z","timestamp":1529155781000},"page":"726-739","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["HashAlign: Hash-Based Alignment of\u00a0Multiple Graphs"],"prefix":"10.1007","author":[{"given":"Mark","family":"Heimann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shengjie","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kuan-Yu","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danai","family":"Koutra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,17]]},"reference":[{"key":"57_CR1","unstructured":"COBRE (2012). http:\/\/fcon_1000.projects.nitrc.org\/indi\/retro\/cobre.html"},{"key":"57_CR2","unstructured":"Konect: Koblenz network collection (2016). http:\/\/konect.uni-koblenz.de\/networks\/"},{"key":"57_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Indyk, P.: Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions. In: FOCS. IEEE (2006)","DOI":"10.1109\/FOCS.2006.49"},{"issue":"1","key":"57_CR4","first-page":"3:1","volume":"7","author":"M Bayati","year":"2013","unstructured":"Bayati, M., Gleich, D.F., Saberi, A., Wang, Y.: Message-passing algorithms for sparse network alignment. ACM TKDD 7(1), 3:1\u20133:31 (2013)","journal-title":"ACM TKDD"},{"key":"57_CR5","doi-asserted-by":"publisher","first-page":"37009","DOI":"10.1209\/0295-5075\/89\/37009","volume":"89","author":"S Bradde","year":"2010","unstructured":"Bradde, S., Braunstein, A., Mahmoudi, H., Tria, F., Weigt, M., Zecchina, R.: Aligning graphs and finding substructures by a cavity approach. Europhys. Lett. 89, 37009 (2010)","journal-title":"Europhys. Lett."},{"key":"57_CR6","doi-asserted-by":"crossref","unstructured":"Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: SCG, pp. 253\u2013262. ACM (2004)","DOI":"10.1145\/997817.997857"},{"key":"57_CR7","doi-asserted-by":"crossref","unstructured":"Ding, C.H.Q., Li, T., Jordan, M.I.: Nonnegative matrix factorization for combinatorial optimization: spectral clustering, graph matching, and clique finding. In: ICDM (2008)","DOI":"10.1109\/ICDM.2008.130"},{"key":"57_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-35176-1_4","volume-title":"The Semantic Web \u2013 ISWC 2012","author":"S Duan","year":"2012","unstructured":"Duan, S., Fokoue, A., Hassanzadeh, O., Kementsietsidis, A., Srinivas, K., Ward, M.J.: Instance-based matching of large ontologies using locality-sensitive hashing. In: Cudr\u00e9-Mauroux, P., Heflin, J., Sirin, E., Tudorache, T., Euzenat, J., Hauswirth, M., Parreira, J.X., Hendler, J., Schreiber, G., Bernstein, A., Blomqvist, E. (eds.) ISWC 2012. LNCS, vol. 7649, pp. 49\u201364. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-35176-1_4"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"Goyal, P., Ferrara, E.: Graph embedding techniques, applications, and performance: a survey. arXiv preprint arXiv:1705.02801 (2017)","DOI":"10.1016\/j.knosys.2018.03.022"},{"key":"57_CR10","unstructured":"Heimann, M., Koutra, D.: On generalizing neural node embedding methods to multi-network problems. In: KDD MLG Workshop (2017)"},{"key":"57_CR11","unstructured":"Heimann, M., Shen, H., Koutra, D.: Node representation learning for multiple networks: The case of graph alignment. arXiv preprint arXiv:1802.06257 (2018)"},{"key":"57_CR12","doi-asserted-by":"publisher","unstructured":"Khan, K.U., Nawaz, W., Lee, Y.K.: Set-based unified approach for attributed graph summarization. In: IEEE BDCC, December 2014. https:\/\/doi.org\/10.1109\/BDCloud.2014.108","DOI":"10.1109\/BDCloud.2014.108"},{"issue":"2","key":"57_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00796ED1V01Y201708DMK014","volume":"9","author":"D Koutra","year":"2017","unstructured":"Koutra, D., Faloutsos, C.: Individual and collective graph mining: principles, algorithms, and applications. Synth. Lect. Data Min. Knowl. Discov. 9(2), 1\u2013206 (2017)","journal-title":"Synth. Lect. Data Min. Knowl. Discov."},{"key":"57_CR14","doi-asserted-by":"crossref","unstructured":"Koutra, D., Tong, H., Lubensky, D.: Big-align: fast bipartite graph alignment. In: ICDM. IEEE (2013)","DOI":"10.1109\/ICDM.2013.152"},{"issue":"1","key":"57_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2898361","volume":"8","author":"J Leskovec","year":"2016","unstructured":"Leskovec, J., Sosi\u010d, R.: SNAP: a general-purpose network analysis and graph-mining library. ACM TIST 8(1), 1 (2016)","journal-title":"ACM TIST"},{"key":"57_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10618-017-0505-2","volume":"31","author":"E Malmi","year":"2017","unstructured":"Malmi, E., Chawla, S., Gionis, A.: Lagrangian relaxations for multiple network alignment. Data Mining Knowl. Discov. 31, 1\u201328 (2017)","journal-title":"Data Mining Knowl. Discov."},{"key":"57_CR17","doi-asserted-by":"crossref","unstructured":"Safavi, T., Sripada, C., Koutra, D.: Scalable hashing-based network discovery. In: ICDM. IEEE (2017)","DOI":"10.1109\/ICDM.2017.50"},{"issue":"35","key":"57_CR18","doi-asserted-by":"publisher","first-page":"12763","DOI":"10.1073\/pnas.0806627105","volume":"105","author":"R Singh","year":"2008","unstructured":"Singh, R., Xu, J., Berger, B.: Global alignment of multiple protein interaction networks with application to functional orthology detection. PNAS 105(35), 12763\u201312768 (2008)","journal-title":"PNAS"},{"key":"57_CR19","doi-asserted-by":"crossref","unstructured":"Zhang, J., Yu, P.S.: Multiple anonymized social networks alignment. In: ICDM. IEEE (2015)","DOI":"10.1109\/ICDM.2015.114"},{"key":"57_CR20","doi-asserted-by":"crossref","unstructured":"Zhang, S., Tong, H.: Final: Fast attributed network alignment. In: KDD. ACM (2016)","DOI":"10.1145\/2939672.2939766"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93040-4_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T10:09:26Z","timestamp":1710324566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93040-4_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319930398","9783319930404"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93040-4_57","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"17 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"3 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/prada-research.net\/pakdd18\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}