{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,26]],"date-time":"2026-08-26T12:27:50Z","timestamp":1787747270549,"version":"build-2784847793"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030375980","type":"print"},{"value":"9783030375997","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-37599-7_12","type":"book-chapter","created":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T09:02:43Z","timestamp":1578042163000},"page":"130-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Network Alignment Using Graphlet Signature and High Order Proximity"],"prefix":"10.1007","author":[{"given":"Aljohara","family":"Almulhim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vachik S.","family":"Dave","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad Al","family":"Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,1,3]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2435209.2435212","volume":"7","author":"M Bayati","year":"2013","unstructured":"Bayati, M., Gleich, D.F., Saberi, A., Wang, Y.: Message-passing algorithms for sparse network alignment. Tran. Knowl. Discov. Data 7(1), 1\u201331 (2013)","journal-title":"Tran. Knowl. Discov. Data"},{"issue":"03","key":"12_CR2","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1142\/S0218001404003228","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recognit Artif Intell. 18(03), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recognit Artif Intell."},{"key":"12_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Heimann, M., Shen, H., Safavi, T., Koutra, D.: Regal: representation learning-based graph alignment. In: ACM CIKM, pp. 117\u2013126 (2018)","DOI":"10.1145\/3269206.3271788"},{"issue":"4","key":"12_CR5","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar, T., Dem\u0161ar, J.: A combinatorial approach to graphlet counting. Bioinformatics 30(4), 559\u2013565 (2014)","journal-title":"Bioinformatics"},{"issue":"1","key":"12_CR6","doi-asserted-by":"publisher","first-page":"S59","DOI":"10.1186\/1471-2105-10-S1-S59","volume":"10","author":"GW Klau","year":"2009","unstructured":"Klau, G.W.: A new graph-based method for pairwise global network alignment. BMC Bioinform. 10(1), S59 (2009)","journal-title":"BMC Bioinform."},{"issue":"50","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1098\/rsif.2010.0063","volume":"7","author":"O Kuchaiev","year":"2010","unstructured":"Kuchaiev, O., Milenkovi\u0107, T., Memi\u0161evi\u0107, V., Hayes, W., Pr\u017eulj, N.: Topological network alignment uncovers biological function and phylogeny. J. R. Soc. Interface 7(50), 1341\u20131354 (2010)","journal-title":"J. R. Soc. Interface"},{"issue":"1\u20132","key":"12_CR8","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"HW Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Res. Logistics Q. 2(1\u20132), 83\u201397 (1955)","journal-title":"Naval Res. Logistics Q."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Lacoste-Julien, S., Taskar, B., Klein, D., Jordan, M.I.: Word alignment via quadratic assignment. In: Conference of the North American Chapter of the Association of Computational Linguistics, pp. 112\u2013119 (2006)","DOI":"10.3115\/1220835.1220850"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Liu, S., Wang, S., Zhu, F., Zhang, J., Krishnan, R.: Hydra: large-scale social identity linkage via heterogeneous behavior modeling. In: ACM SIGMOD International Conference on Management of Data, pp. 51\u201362 (2014)","DOI":"10.1145\/2588555.2588559"},{"key":"12_CR11","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to schema matching. In: Proceedings 18th International Conference on Data Engineering, pp. 117\u2013128. IEEE (2002)"},{"issue":"10","key":"12_CR12","first-page":"2466","volume":"26","author":"M Rahman","year":"2014","unstructured":"Rahman, M., Bhuiyan, M.A., Hasan, M.A.: Graft: an efficient graphlet counting method for large graph analysis. IEEE TKDE 26(10), 2466\u20132478 (2014)","journal-title":"IEEE TKDE"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11585978_12","volume-title":"Energy Minimization Methods in Computer Vision and Pattern Recognition","author":"C Schellewald","year":"2005","unstructured":"Schellewald, C., Schn\u00f6rr, C.: Probabilistic subgraph matching based on convex relaxation. In: Rangarajan, A., Vemuri, B., Yuille, A.L. (eds.) EMMCVPR 2005. LNCS, vol. 3757, pp. 171\u2013186. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11585978_12"},{"key":"12_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-71681-5_2","volume-title":"Research in Computational Molecular Biology","author":"R Singh","year":"2007","unstructured":"Singh, R., Xu, J., Berger, B.: Pairwise global alignment of protein interaction networks by matching neighborhood topology. In: Speed, T., Huang, H. (eds.) RECOMB 2007. LNCS, vol. 4453, pp. 16\u201331. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-71681-5_2"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11732990_1","volume-title":"Research in Computational Molecular Biology","author":"BS Srinivasan","year":"2006","unstructured":"Srinivasan, B.S., Novak, A.F., Flannick, J.A., Batzoglou, S., McAdams, H.H.: Integrated protein interaction networks for 11 microbes. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2006. LNCS, vol. 3909, pp. 1\u201314. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11732990_1"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: WWW 2015, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, S., Tong, H.: Final: fast attributed network alignment. In: ACM SIGKDD, pp. 1345\u20131354 (2016)","DOI":"10.1145\/2939672.2939766"}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37599-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,3]],"date-time":"2020-01-03T10:11:04Z","timestamp":1578046264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37599-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030375980","9783030375997"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37599-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siena","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","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":"mod2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2019.icas.xyz\/","order":11,"name":"conference_url","label":"Conference URL","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":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"158","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":"64","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":"0","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":"41% - 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":"5","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":"3","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)"}}]}}