{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:30:19Z","timestamp":1725798619242},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444146"},{"type":"electronic","value":"9783662444153"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44415-3_7","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T04:40:31Z","timestamp":1407904831000},"page":"63-72","source":"Crossref","is-referenced-by-count":7,"title":["Improving Approximate Graph Edit Distance Using Genetic Algorithms"],"prefix":"10.1007","author":[{"given":"Kaspar","family":"Riesen","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Fischer","sequence":"additional","affiliation":[]},{"given":"Horst","family":"Bunke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"7_CR1","doi-asserted-by":"crossref","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. Journal of Pattern Recognition and Artificial Intelligence\u00a018(3), 265\u2013298 (2004)","journal-title":"Int. Journal of Pattern Recognition and Artificial Intelligence"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38221-5_1","volume-title":"Graph-Based Representations in Pattern Recognition","author":"M. Vento","year":"2013","unstructured":"Vento, M.: A one hour trip in the world of graphs, looking at the papers of the last ten years. In: Kropatsch, W.G., Artner, N.M., Haxhimusa, Y., Jiang, X. (eds.) GbRPR 2013. LNCS, vol.\u00a07877, pp. 1\u201310. Springer, Heidelberg (2013)"},{"key":"7_CR3","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 Recognition Letters\u00a01, 245\u2013253 (1983)","journal-title":"Pattern Recognition Letters"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-27868-9_18","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M. Neuhaus","year":"2004","unstructured":"Neuhaus, M., Bunke, H.: An error-tolerant approximate matching algorithm for attributed planar graphs and its application to fingerprint classification. In: Fred, A., Caelli, T.M., Duin, R.P.W., Campilho, A.C., de Ridder, D. (eds.) SSPR&SPR 2004. LNCS, vol.\u00a03138, pp. 180\u2013189. Springer, Heidelberg (2004)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/3-540-45028-9_9","volume-title":"Graph Based Representations in Pattern Recognition","author":"R. Ambauen","year":"2003","unstructured":"Ambauen, R., Fischer, S., Bunke, H.: Graph edit distance with node splitting and merging and its application to diatom identification. In: Hancock, E., Vento, M. (eds.) GbRPR 2003. LNCS, vol.\u00a02726, pp. 95\u2013106. Springer, Heidelberg (2003)"},{"issue":"3","key":"7_CR6","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 Transactions on Pattern Analysis and Machine Intelligence\u00a027(3), 365\u2013378 (2005)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"2","key":"7_CR7","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P. Hart","year":"1968","unstructured":"Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems, Science, and Cybernetics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions of Systems, Science, and Cybernetics"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/978-3-540-24838-5_8","volume-title":"Experimental and Efficient Algorithms","author":"M.C. Boeres","year":"2004","unstructured":"Boeres, M.C., Ribeiro, C.C., Bloch, I.: A randomized heuristic for scene recognition by graph matching. In: Ribeiro, C.C., Martins, S.L. (eds.) WEA 2004. LNCS, vol.\u00a03059, pp. 100\u2013113. Springer, Heidelberg (2004)"},{"key":"7_CR9","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.\u00a03434, pp. 172\u2013182. Springer, Heidelberg (2005)"},{"issue":"8","key":"7_CR10","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. on Pattern Analysis ans Machine Intelligence\u00a028(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. on Pattern Analysis ans Machine Intelligence"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11815921_17","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"M. Neuhaus","year":"2006","unstructured":"Neuhaus, M., Riesen, K., Bunke, H.: Fast suboptimal algorithms for the computation of graph edit distance. In: Yeung, D.-Y., Kwok, J.T., Fred, A., Roli, F., de Ridder, D. (eds.) SSPR&SPR 2006. LNCS, vol.\u00a04109, pp. 163\u2013172. Springer, Heidelberg (2006)"},{"issue":"4","key":"7_CR12","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 and Vision Computing\u00a027(4), 950\u2013959 (2009)","journal-title":"Image and Vision Computing"},{"issue":"6","key":"7_CR13","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1016\/S0031-3203(96)00123-9","volume":"30","author":"A. Cross","year":"1997","unstructured":"Cross, A., Wilson, R., Hancock, E.: Inexact graph matching using genetic search. Pattern Recognition\u00a030(6), 953\u2013970 (1997)","journal-title":"Pattern Recognition"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1109\/3477.604100","volume":"27","author":"I. Wang","year":"1997","unstructured":"Wang, I., Fan, K.C., Horng, J.T.: Genetic-based search for error-correcting graph isomorphism. IEEE Transactions on Systems, Man, and Cybernetics (Part B)\u00a027(4), 588\u2013597 (1997)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics (Part B)"},{"issue":"9","key":"7_CR15","doi-asserted-by":"publisher","first-page":"1883","DOI":"10.1016\/S0031-3203(01)00136-4","volume":"35","author":"P. Suganthan","year":"2002","unstructured":"Suganthan, P.: Structural pattern recognition using genetic algorithms. Pattern Recognition\u00a035(9), 1883\u20131893 (2002)","journal-title":"Pattern Recognition"},{"key":"7_CR16","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, and Statistical 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.\u00a05342, pp. 287\u2013297. Springer, Heidelberg (2008)"},{"key":"7_CR17","unstructured":"DTP, AIDS antiviral screen (2004), \n                    \n                      http:\/\/dtp.nci.nih.gov\/docs\/aids\/aids_data.html"},{"key":"7_CR18","unstructured":"Watson, C., Wilson, C.: NIST Special Database 4, Fingerprint Database. National Institute of Standards and Technology (March 1992)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/11767978_35","volume-title":"Graphics Recognition. Ten Years Review and Future Perspectives","author":"P. Dosch","year":"2006","unstructured":"Dosch, P., Valveny, E.: Report on the second symbol recognition contest. In: Liu, W., Llad\u00f3s, J. (eds.) GREC 2005. LNCS, vol.\u00a03926, pp. 381\u2013397. Springer, Heidelberg (2006)"},{"issue":"11","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1016\/0167-8655(94)90127-9","volume":"15","author":"P. Pudil","year":"1994","unstructured":"Pudil, P., Novovicova, J., Kittler, J.: Floating search methods in feature-selection. Pattern Recognition Letters\u00a015(11), 1119\u20131125 (1994)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44415-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T15:11:28Z","timestamp":1558969888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44415-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444146","9783662444153"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44415-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}