{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:04:37Z","timestamp":1743123877824,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319210230"},{"type":"electronic","value":"9783319210247"}],"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-21024-7_2","type":"book-chapter","created":{"date-parts":[[2015,6,30]],"date-time":"2015-06-30T13:17:17Z","timestamp":1435670237000},"page":"17-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Learning Heuristics to Reduce the Overestimation of Bipartite Graph Edit Distance Approximation"],"prefix":"10.1007","author":[{"given":"Miquel","family":"Ferrer","sequence":"first","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]},{"given":"Kaspar","family":"Riesen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,1]]},"reference":[{"key":"2_CR1","volume-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","author":"CM Bishop","year":"2006","unstructured":"Bishop, C.M.: Pattern Recognition and Machine Learning (Information Science and Statistics). Springer-Verlag New York Inc, Secaucus (2006)"},{"key":"2_CR2","volume-title":"Pattern Classification","author":"RO Duda","year":"2000","unstructured":"Duda, R.O., Hart, P.E., Stork, D.G.: Pattern Classification, 2nd edn. Wiley-Interscience, New York (2000)","edition":"2"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/978-3-319-08979-9_27","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"A Silva","year":"2014","unstructured":"Silva, A., Antunes, C.: Finding multi-dimensional patterns in healthcare. In: Perner, P. (ed.) MLDM 2014. LNCS, vol. 8556, pp. 361\u2013375. Springer, Heidelberg (2014)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-642-39712-7_20","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"K Dittakan","year":"2013","unstructured":"Dittakan, K., Coenen, F., Christley, R.: Satellite image mining for census collection: a comparative study with respect to the ethiopian hinterland. In: Perner, P. (ed.) MLDM 2013. LNCS, vol. 7988, pp. 260\u2013274. Springer, Heidelberg (2013)"},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.1142\/5832","volume-title":"Graph-Theoretic Techniques for Web Content Mining","author":"A Schenker","year":"2005","unstructured":"Schenker, A., Bunke, H., Last, M., Kandel, A.: Graph-Theoretic Techniques for Web Content Mining. World Scientific, Singapore (2005)"},{"key":"2_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0470073047","volume-title":"Mining Graph Data","author":"DJ Cook","year":"2006","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. John Wiley and Sons, New York (2006)"},{"issue":"1","key":"2_CR7","first-page":"1450001","volume":"28","author":"P Foggia","year":"2014","unstructured":"Foggia, P., Percannella, G., Vento, M.: Graph matching and learning in pattern recognition in the last 10 years. IJPRAI 28(1), 1450001 (2014)","journal-title":"IJPRAI"},{"issue":"3","key":"2_CR8","first-page":"265","volume":"18","author":"D Conte","year":"2004","unstructured":"Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. IJPRAI 18(3), 265\u2013298 (2004)","journal-title":"IJPRAI"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Sanfeliu, A., Fu, K.-S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. SMC-13 (3), 353\u2013362 (1983)","DOI":"10.1109\/TSMC.1983.6313167"},{"issue":"4","key":"2_CR10","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(4), 245\u2013253 (1983)","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11527923_20","volume-title":"Audio- and Video-Based Biometric Person Authentication","author":"M Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: A graph matching based approach to fingerprint classification using directional variance. In: Kanade, T., Jain, A., Ratha, N.K. (eds.) AVBPA 2005. LNCS, vol. 3546, pp. 191\u2013200. Springer, Heidelberg (2005)"},{"issue":"3","key":"2_CR12","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.R.: 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."},{"key":"2_CR13","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":"2_CR14","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.O.: A binary linear programming formulation of the graph edit distance. IEEE Trans. PAMI 28(8), 1200\u20131214 (2006)","journal-title":"IEEE Trans. PAMI"},{"issue":"7","key":"2_CR15","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(7), 950\u2013959 (2009)","journal-title":"Image Vis. Comput."},{"issue":"1","key":"2_CR16","first-page":"183","volume":"157","author":"RE Burkard","year":"2009","unstructured":"Burkard, R.E., Dell\u2019Amico, M., Martello, S.: Assignment problems. SIAM 157(1), 183\u2013190 (2009)","journal-title":"SIAM"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-319-11656-3_11","volume-title":"Artificial Neural Networks in Pattern Recognition","author":"K Riesen","year":"2014","unstructured":"Riesen, K., Fischer, A., Bunke, H.: Combining bipartite graph matching and beam search for graph edit distance approximation. In: El Gayar, N., Schwenker, F., Suen, C. (eds.) ANNPR 2014. LNCS, vol. 8774, pp. 117\u2013128. Springer, Heidelberg (2014)"},{"issue":"2","key":"2_CR18","first-page":"100","volume":"SSC\u20134","author":"NJ Nilsson","year":"1968","unstructured":"Nilsson, N.J., Hart, P.E., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. SSC\u20134(2), 100\u2013107 (1968)","journal-title":"IEEE Trans. Syst. Sci. Cybern."},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.patrec.2014.04.015","volume":"45","author":"F Serratosa","year":"2014","unstructured":"Serratosa, F.: Fast computation of bipartite graph matching. Pattern Recogn. Lett. 45, 244\u2013250 (2014)","journal-title":"Pattern Recogn. Lett."},{"key":"2_CR20","doi-asserted-by":"crossref","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.-Y., Georgiopoulos, M., Anagnostopoulos, G.C., Loog, M. (eds.) SSPR\/SPR. LNCS, vol. 5342, pp. 287\u2013297. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-89689-0_33"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Data Mining in Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21024-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,20]],"date-time":"2023-01-20T15:28:43Z","timestamp":1674228523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21024-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319210230","9783319210247"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21024-7_2","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":"1 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}