{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:37:49Z","timestamp":1743122269039,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030858957"},{"type":"electronic","value":"9783030858964"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-85896-4_4","type":"book-chapter","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T10:06:38Z","timestamp":1629281198000},"page":"44-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["GRASP: Graph Alignment Through Spectral Signatures"],"prefix":"10.1007","author":[{"given":"Judith","family":"Hermanns","sequence":"first","affiliation":[]},{"given":"Anton","family":"Tsitsulin","sequence":"additional","affiliation":[]},{"given":"Marina","family":"Munkhoeva","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Bronstein","sequence":"additional","affiliation":[]},{"given":"Davide","family":"Mottin","sequence":"additional","affiliation":[]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,19]]},"reference":[{"issue":"3","key":"4_CR1","first-page":"303","volume":"7","author":"PA Absil","year":"2007","unstructured":"Absil, P.A., Baker, C.G., Gallivan, K.A.: Trust-region methods on riemannian manifolds. FoCM 7(3), 303\u2013330 (2007)","journal-title":"FoCM"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Bayati, M., Gleich, D.F., Saberi, A., Wang, Y.: Message-passing algorithms for sparse network alignment. TKDD 7(1), 3:1\u20133:31 (2013)","DOI":"10.1145\/2435209.2435212"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Belkin, M., Niyogi, P.: Convergence of laplacian eigenmaps. In: NeurIPS, pp. 129\u2013136 (2006)","DOI":"10.7551\/mitpress\/7503.003.0021"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Chen, X., Heimann, M., Vahedian, F., Koutra, D.: Cone-align: consistent network alignment with proximity-preserving node embedding. In: CIKM, pp. 1985\u20131988 (2020)","DOI":"10.1145\/3340531.3412136"},{"key":"4_CR5","unstructured":"Chung, F.R., Graham, F.C.: Spectral graph theory. No. 92, American Mathematical Soc. (1997)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Cohen-Steiner, D., Kong, W., Sohler, C., Valiant, G.: Approximating the spectrum of a graph. In: KDD, pp. 1263\u20131271 (2018)","DOI":"10.1145\/3219819.3220119"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"El-Kebir, M., Heringa, J., Klau, G.W.: Natalie 2.0: Sparse global network alignment as a special case of quadratic assignment. Algorithms 8(4), 1035\u20131051 (2015)","DOI":"10.3390\/a8041035"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Feizi, S., Quon, G., Mendoza, M., Medard, M., Kellis, M., Jadbabaie, A.: Spectral alignment of graphs. IEEE Trans. Netw, Sci (2019)","DOI":"10.1109\/TNSE.2019.2913233"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Heimann, M., Shen, H., Safavi, T., Koutra, D.: REGAL: representation learning-based graph alignment. In: CIKM, pp. 117\u2013126 (2018)","DOI":"10.1145\/3269206.3271788"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/BF02278710","volume":"38","author":"R Jonker","year":"1987","unstructured":"Jonker, R., Volgenant, A.: A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38(4), 325\u2013340 (1987)","journal-title":"Computing"},{"issue":"10","key":"4_CR11","first-page":"1010","volume":"8","author":"E Kazemi","year":"2015","unstructured":"Kazemi, E., Hassani, S.H., Grossglauser, M.: Growing a graph matching from a handful of seeds. PVLDB 8(10), 1010\u20131021 (2015)","journal-title":"PVLDB"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Klau, G.W.: A new graph-based method for pairwise global network alignment. BMC Bioinf. 10(S-1) (2009)","DOI":"10.1186\/1471-2105-10-S1-S59"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Knossow, D., Sharma, A., Mateus, D., Horaud, R.: Inexact matching of large and sparse graphs using laplacian eigenvectors. In: GdR International Working, pp. 144\u2013153 (2009)","DOI":"10.1007\/978-3-642-02124-4_15"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1111\/cgf.12064","volume":"32","author":"A Kovnatsky","year":"2013","unstructured":"Kovnatsky, A., Bronstein, M.M., Bronstein, A.M., Glashoff, K., Kimmel, R.: Coupled quasi-harmonic bases. Comput Graph Forum. 32, 439\u2013448 (2013)","journal-title":"Comput Graph Forum."},{"issue":"12","key":"4_CR15","doi-asserted-by":"publisher","first-page":"i253","DOI":"10.1093\/bioinformatics\/btp203","volume":"25","author":"CS Liao","year":"2009","unstructured":"Liao, C.S., Lu, K., Baym, M., Singh, R., Berger, B.: IsoRankN: spectral methods for global alignment of multiple protein networks. Bioinformatics 25(12), i253\u2013i258 (2009)","journal-title":"Bioinformatics"},{"key":"4_CR16","unstructured":"Liu, L., Cheung, W.K., Li, X., Liao, L.: Aligning users across social networks using network embedding. In: IJCAI, pp. 1774\u20131780 (2016)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Nassar, H., Veldt, N., Mohammadi, S., Grama, A., Gleich, D.F.: Low rank spectral network alignment. In: WWW, pp. 619\u2013628 (2018)","DOI":"10.1145\/3178876.3186128"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Ovsjanikov, M., Ben-Chen, M., Solomon, J., Butscher, A., Guibas, L.J.: Functional maps: a flexible representation of maps between shapes. ACM Trans. Graph. 31(4), 30:1\u201330:11 (2012)","DOI":"10.1145\/2185520.2185526"},{"issue":"8","key":"4_CR19","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"35","key":"4_CR20","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":"4_CR21","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., Bronstein, A.M., M\u00fcller, E.: NetLSD: hearing the shape of a graph. In: KDD, pp. 2347\u20132356 (2018)","DOI":"10.1145\/3219819.3219991"},{"issue":"5","key":"4_CR22","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1109\/34.6778","volume":"10","author":"S Umeyama","year":"1988","unstructured":"Umeyama, S.: An eigendecomposition approach to weighted graph matching problems. IEEE Trans. Pattern Anal. Mach. Intell. 10(5), 695\u2013703 (1988)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Yartseva, L., Grossglauser, M.: On the performance of percolation graph matching. In: ACM COSN, pp. 119\u2013130 (2013)","DOI":"10.1145\/2512938.2512952"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Yasar, A., \u00c7ataly\u00fcrek, \u00dc.V.: An iterative global structure-assisted labeled network aligner. In: KDD, pp. 2614\u20132623 (2018)","DOI":"10.1145\/3219819.3220079"},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, S., Tong, H.: FINAL: fast attributed network alignment. In: KDD, pp. 1345\u20131354 (2016)","DOI":"10.1145\/2939672.2939766"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Zhou, F., Liu, L., Zhang, K., Trajcevski, G., Wu, J., Zhong, T.: Deeplink: a deep learning approach for user identity linkage. In: INFOCOM, pp. 1313\u20131321 (2018)","DOI":"10.1109\/INFOCOM.2018.8486231"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85896-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T14:16:36Z","timestamp":1699366596000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85896-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030858957","9783030858964"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85896-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"19 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"184","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - 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 (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6.38","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}