{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:38:21Z","timestamp":1742956701977,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319202471"},{"type":"electronic","value":"9783319202488"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-20248-8_13","type":"book-chapter","created":{"date-parts":[[2015,6,3]],"date-time":"2015-06-03T03:05:22Z","timestamp":1433300722000},"page":"147-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Suboptimal Graph Edit Distance Based on Sorted Local Assignments"],"prefix":"10.1007","author":[{"given":"Kaspar","family":"Riesen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miquel","family":"Ferrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,3]]},"reference":[{"issue":"2","key":"13_CR1","first-page":"231","volume":"8","author":"A Lumini","year":"1999","unstructured":"Lumini, A., Maio, D., Maltoni, D.: Inexact graph matching for fingerprint classification. Mach. Graph. Vis. Spec. Issue Gr. Transform. Pattern Gener. CAD 8(2), 231\u2013248 (1999)","journal-title":"Mach. Graph. Vis. Spec. Issue Gr. Transform. Pattern Gener. CAD"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MSP.2012.2233865","volume":"30","author":"J Richiardi","year":"2013","unstructured":"Richiardi, J., Achard, S., Bunke, H., Van De Ville, D.: Machine learning with brain graphs: predictive modeling approaches for functional imaging in systems neuroscience. IEEE Signal Process. Mag. 30(3), 58\u201370 (2013)","journal-title":"IEEE Signal Process. Mag."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Cesare, S., Xiang, Y.: Malware variant detection using similarity search over sets of control flow graphs. In: Proceedings of 10th International Conference on Trust, Security and Privacy in Computing and Communications, pp. 181\u2013189 (2011)","DOI":"10.1109\/TrustCom.2011.26"},{"issue":"3","key":"13_CR4","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 Recog. Artif. Intell. 18(3), 265\u2013298 (2004)","journal-title":"Int. J. Pattern Recog. Artif. Intell."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. Int. J. Pattern Recog. Art. Intell. Online Ready 28 (2014)","DOI":"10.1142\/S0218001414500013"},{"issue":"15","key":"13_CR6","doi-asserted-by":"publisher","first-page":"2038","DOI":"10.1016\/j.patrec.2012.03.020","volume":"33","author":"B Ga\u00fcz\u00e8re","year":"2012","unstructured":"Ga\u00fcz\u00e8re, B., Brun, L., Villemin, D.: Two new graphs kernels in chemoinformatics. Pattern Recogn. Lett. 33(15), 2038\u20132047 (2012)","journal-title":"Pattern Recogn. Lett."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-38221-5_11","volume-title":"Graph-Based Representations in Pattern Recognition","author":"L Rossi","year":"2013","unstructured":"Rossi, L., Torsello, A., Hancock, E.R.: A continuous-time quantum walk kernel for unattributed graphs. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol. 7877, pp. 101\u2013110. Springer, Heidelberg (2013)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-540-72903-7_8","volume-title":"Graph-Based Representations in Pattern Recognition","author":"D Emms","year":"2007","unstructured":"Emms, D., Hancock, E.R., Wilson, R.C.: A correspondence measure for graph matching using the discrete quantum walk. In: Escolano, F., Vento, M. (eds.) GbRPR. LNCS, vol. 4538, pp. 81\u201391. Springer, Heidelberg (2007)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/0167-8655(83)90033-8","volume":"1","author":"H Bunke","year":"1983","unstructured":"Bunke, H., Allermann, G.: Inexact graph matching for structural pattern recognition. Pattern Recogn. Lett. 1, 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"13_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A Sanfeliu","year":"1983","unstructured":"Sanfeliu, A., Fu, K.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. (Part B) 13(3), 353\u2013363 (1983)","journal-title":"IEEE Trans. Syst. Man Cybern. (Part B)"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/TPAMI.2005.56","volume":"27","author":"A Robles-Kelly","year":"2005","unstructured":"Robles-Kelly, A., Hancock, E.: Graph edit distance from spectral seriation. IEEE Trans. Pattern Anal. Mach. Intell. 27(3), 365\u2013378 (2005)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"6","key":"13_CR12","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1109\/34.862201","volume":"22","author":"R Myers","year":"2000","unstructured":"Myers, R., Wilson, R., Hancock, E.: Bayesian graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 22(6), 628\u2013635 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR13","unstructured":"Rebagliati, N., Sol\u00e9-Ribalta, A., Pelillo, M., Serratosa, F.: Computing the graph edit distance using dominant sets. In: Proceedings of 21st International Conference on Pattern Recognition, pp. 1080\u20131083 (2012)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-31988-7_16","volume-title":"Graph-Based Representations in Pattern Recognition","author":"S Sorlin","year":"2005","unstructured":"Sorlin, S., Solnon, C.: Reactive tabu search for measuring graph similarity. In: Brun, L., Vento, M. (eds.) GbRPR 2005. LNCS, vol. 3434, pp. 172\u2013182. Springer, Heidelberg (2005)"},{"issue":"8","key":"13_CR15","doi-asserted-by":"publisher","first-page":"1200","DOI":"10.1109\/TPAMI.2006.152","volume":"28","author":"D Justice","year":"2006","unstructured":"Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Trans. Pattern Anal. Mach. Intell. 28(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"13_CR16","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.imavis.2008.04.004","volume":"27","author":"K Riesen","year":"2009","unstructured":"Riesen, K., Bunke, H.: Approximate graph edit distance computation by means of bipartite graph matching. Image Vis. Comput. 27(4), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"6","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T Caetano","year":"2009","unstructured":"Caetano, T., McAuley, J.J., Cheng, L., Le, Q., Smola, A.: Learning graph matching. IEEE Trans. Pattern Anal. Mach. Intell. 31(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717754","volume-title":"Assignment Problems","author":"R Burkard","year":"2009","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment Problems. Society for Industrial and Applied Mathematics, Philadelphia (2009)"},{"key":"13_CR19","unstructured":"Knuth, D.: 5.2.4: sorting by merging. In: Sorting and Searching. The Art of Computer Programming 3, pp. 158\u2013168. Addison Wesley (1998)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-89689-0_33","volume-title":"Structural, Syntactic, andStatistical Pattern Recognition","author":"K Riesen","year":"2008","unstructured":"Riesen, K., Bunke, H.: IAM graph database repository for graph based pattern recognition and machine learning. In: da Vitoria Lobo, N., Kasparis, T., Roli, F., Kwok, J.T., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR & SPR 2008. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Multiple Classifier Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-20248-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:46:29Z","timestamp":1676943989000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-20248-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319202471","9783319202488"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-20248-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"3 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}