{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:18:31Z","timestamp":1725733111084},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12568-8_62","type":"book-chapter","created":{"date-parts":[[2014,10,23]],"date-time":"2014-10-23T17:38:58Z","timestamp":1414085938000},"page":"506-514","source":"Crossref","is-referenced-by-count":0,"title":["Learning Graph-Matching Substitution Costs Based on the Optimality of the Oracle\u2019s Correspondence"],"prefix":"10.1007","author":[{"given":"Xavier","family":"Cort\u00e9s","sequence":"first","affiliation":[]},{"given":"Carlos Francisco","family":"Moreno-Garc\u00eda","sequence":"additional","affiliation":[]},{"given":"Francesc","family":"Serratosa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Sol\u00e9-Ribalta, A., Cort\u00e9s, X., Serratosa, F.: A comparison between structural and embedding methods for graph classification. In: Gimel\u2019farb, G., Hancock, E., Imiya, A., Kuijper, A., Kudo, M., Omachi, S., Windeatt, T., Yamada, K. (eds.) SSPR & SPR 2012. LNCS, vol.\u00a07626, pp. 234\u2013242. Springer, Heidelberg (2012)","key":"62_CR1","DOI":"10.1007\/978-3-642-34166-3_26"},{"issue":"3-4","key":"62_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S0167-8655(97)00179-7","volume":"19","author":"H. Bunke","year":"1998","unstructured":"Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 1998\u00a019(3-4), 255\u2013259 (1998)","journal-title":"Pattern Recognition Letters, 1998"},{"issue":"1","key":"62_CR3","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/TPAMI.1985.4767621","volume":"7","author":"L. Shapiro","year":"1985","unstructured":"Shapiro, L., Haralick, R.: A Metric for Comparing Relational Descriptions. Transactions on Pattern Analysis and Machine Intelligence, 1985\u00a07(1), 90\u201394 (1985)","journal-title":"Transactions on Pattern Analysis and Machine Intelligence, 1985"},{"issue":"5","key":"62_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.patrec.2009.10.011","volume":"31","author":"R. Raveaux","year":"2010","unstructured":"Raveaux, R., Burie, J.-C., Ogier, J.-M.: A graph matching method and a graph matching distance based on subgraph assignments. Pattern Recognition Letters\u00a031(5), 394\u2013406 (2010)","journal-title":"Pattern Recognition Letters"},{"issue":"9","key":"62_CR5","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1109\/34.790431","volume":"21","author":"H. Bunke","year":"1999","unstructured":"Bunke, H.: Error Correcting Graph Matching: On the Influence of the Underlying Cost Function. Transactions on Pattern Analysis and Machine Intelligence\u00a021(9), 917\u2013922 (1999)","journal-title":"Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"3","key":"62_CR6","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1109\/TSMCB.2005.846635","volume":"35","author":"M. Neuhaus","year":"2005","unstructured":"Neuhaus, M., Bunke, H.: Self-organizing maps for learning the edit costs in graph matching. IEEE Trans. on Sys. Man, and Cybernetics, Part B\u00a035(3), 503\u2013514 (2005)","journal-title":"IEEE Trans. on Sys. Man, and Cybernetics, Part B"},{"issue":"1","key":"62_CR7","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/j.ins.2006.02.013","volume":"177","author":"M. Neuhaus","year":"2007","unstructured":"Neuhaus, M., Bunke, H.: Automatic learning of cost functions for graph edit distance. Inf. Sci.\u00a0177(1), 239\u2013247 (2007)","journal-title":"Inf. Sci."},{"issue":"6","key":"62_CR8","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/TPAMI.2009.28","volume":"31","author":"T.S. Caetano","year":"2009","unstructured":"Caetano, T.S., McAuley, J.J., Cheng, L., Le, Q.V., Smola, A.J.: Learning Graph Matching. IEEE Trans. Pattern Anal. Mach. Intell.\u00a031(6), 1048\u20131058 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"unstructured":"Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications (July 1998)","key":"62_CR9"},{"issue":"5","key":"62_CR10","first-page":"1","volume":"26","author":"A. Sol\u00e9","year":"2012","unstructured":"Sol\u00e9, A., Serratosa, F., Sanfeliu, A.: On the Graph Edit Distance cost: Properties and Applications. International Journal of Pattern Recognition and Artificial Intelligence\u00a026(5), 1\u201321 (2012)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"62_CR11","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1137\/0724076","volume":"24","author":"R.H. Byrd","year":"1987","unstructured":"Byrd, R.H., Schnabel, R.B., Schultz, G.: A trust region algorithm for nonlinearly constrained optimization. SIAM J. Numer. Anal.\u00a024, 1152\u20131170 (1987)","journal-title":"SIAM J. Numer. Anal."},{"unstructured":"Kelley, C.T.: Iterative Methods for Optimization SIAM Frontiers in Applied Mathematics 18 (1999) ISBN 0-89871-433-8","key":"62_CR12"},{"key":"62_CR13","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1137\/S1052623496303482","volume":"9","author":"K.I.M. McKinnon","year":"1999","unstructured":"McKinnon, K.I.M.: Convergence of the Nelder\u2013Mead simplex method to a non-stationary point. SIAM J Optimization\u00a09, 148\u2013158 (1999)","journal-title":"SIAM J Optimization"},{"issue":"4","key":"62_CR14","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1109\/TPAMI.1981.4767131","volume":"3","author":"G. Fekete","year":"1981","unstructured":"Fekete, G., Eklundh, J.O., Rosenfeld, A.: Relaxation: Evaluation and Applications. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a03(4), 459\u2013469 (1981)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"issue":"4","key":"62_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/34.491619","volume":"18","author":"S. Gold","year":"1996","unstructured":"Gold, S., Rangarajan, A.: A Graduated Assignment Algorithm for Graph Matching. IEEE Trans. on Pattern Analysis and Machine Intelligence\u00a018(4), 377\u2013388 (1996)","journal-title":"IEEE Trans. on Pattern Analysis and Machine Intelligence"},{"unstructured":"Rebagliati, N., Sol\u00e9, A., Pelillo, M., Serratosa, F.: Computing the Graph Edit Distance Using Dominant Sets. In: ICPR 2012, pp. 1080\u20131083 (2012)","key":"62_CR16"},{"issue":"10","key":"62_CR17","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1109\/34.954602","volume":"23","author":"B. Luo Hancock","year":"2001","unstructured":"Luo Hancock, B., Hancock, E.R.: Structural graph matching using the EM algorithm and singular value decomposition. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a023(10), 1120\u20131136 (2001)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"7","key":"62_CR18","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 Vision Computing\u00a027(7), 950\u2013959 (2009)","journal-title":"Image Vision Computing"},{"key":"62_CR19","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The Hungarian Method for the assignment problem. Naval Research Logistics Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistics Quarterly"},{"doi-asserted-by":"crossref","unstructured":"Teo, C., Le, Q., Smola, A., Vishwanathan, S.: A Scalable Modular Convex Solver for Regularized Risk Minimization. Proc. Knowledge Discovery and Data Mining (2007)","key":"62_CR20","DOI":"10.1145\/1281192.1281270"},{"key":"62_CR21","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 Recognition Letters, PRL\u00a045, 244\u2013250 (2014)","journal-title":"Pattern Recognition Letters, PRL"},{"unstructured":"Mythological Creatures 2D database (2009), \n                    \n                      http:\/\/tosca.cs.technion.ac.il","key":"62_CR22"},{"unstructured":"http:\/\/vasc.ri.cmu.edu\/idb\/html\/motion\/","key":"62_CR23"},{"unstructured":"http:\/\/deim.urv.cat\/~francesc.serratosa\/SW\/","key":"62_CR24"}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12568-8_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T03:15:17Z","timestamp":1559013317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12568-8_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12568-8_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}