{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:33:56Z","timestamp":1725489236997},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679462"},{"type":"electronic","value":"9783540445227"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44522-6_25","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:52:36Z","timestamp":1186883556000},"page":"236-245","source":"Crossref","is-referenced-by-count":8,"title":["Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques"],"prefix":"10.1007","author":[{"given":"M.","family":"Lazarescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Bunke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1109\/TPAMI.1981.4767144","volume":"3","author":"L.G. Shapiro","year":"1981","unstructured":"L.G. Shapiro and R.M. Haralick. Structural descriptions and inexact matching. IEEE Trans. Pattern Analysis and Machine Intelligence, volume 3, pages 504\u2013519, 1981.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","volume":"13","author":"A. Sanfeliu","year":"1983","unstructured":"A. Sanfeliu and K.S. Fu. A distance measure between attributed relational graphs for pattern recognition. In IEEE Trans. Systems, Man, and Cybernetics, volume 13, pages 353\u2013363, 1983.","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1109\/34.682179","volume":"20","author":"B. Messmer","year":"1998","unstructured":"B. Messmer and H. Bunke. A new algorithm for error-tolerant subgraph isomorphism detection. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 20, pages 493\u2013505, 1998.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1016\/0031-3203(91)90029-5","volume":"24","author":"S.W. Lu","year":"1991","unstructured":"S.W. Lu, Y. Ren, and C.Y. Suen. Hierarchical attributed graph represenation and recognition of handwritten Chinese characters. In Pattern Recognition, volume 24, pages 617\u2013632, 1991.","journal-title":"Pattern Recognition"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1109\/34.277592","volume":"16","author":"J. Rocha","year":"1994","unstructured":"J. Rocha and T. Pavlidis. A shape analysis model with applications to a character recognition system. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 16, pages 393\u2013404, 1994.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"25_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218001490000022","volume":"4","author":"S.W. Lee","year":"1990","unstructured":"S.W. Lee, J.H. Kim, and F.C.A Groen. Translation-, rotation-, and scale-invariant recognition of hand-drawn symbols in schematic diagrams. In Int\u2019l J. Pattern Recognition and Artificial Intelligence, volume 4, no. 1, pages 1\u201315, 1990.","journal-title":"Int\u2019l J. Pattern Recognition and Artificial Intelligence"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"H. Bunke, B. Messmer. Clustering and error-correcting matching of graphs for learning and recognition of symbols in engineering drawings. J. Hull and S. Taylor (eds.): Document Analysis Systems II, pages 102\u2013117. World Scientific, 1998.","DOI":"10.1142\/9789812797704_0006"},{"issue":"9","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1016\/0031-3203(94)90007-8","volume":"27","author":"A. Pearce","year":"1994","unstructured":"A. Pearce, T. Caelli, and W.F. Bischof. Rulegraphs for graph matching in pattern recognition. In Pattern Recognition, volume 27, no. 9, pages 1231\u20131246, 1994.","journal-title":"Pattern Recognition"},{"issue":"3","key":"25_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0031-3203(92)90111-U","volume":"25","author":"E.K. Wong","year":"1992","unstructured":"E.K. Wong. Model matching in robot vision by subgraph isomorphism. In Pattern Recognition, volume 25, no. 3, pages 287\u2013304, 1992.","journal-title":"Pattern Recognition"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1109\/TPAMI.1982.4767312","volume":"3","author":"L.G. Shapiro","year":"1982","unstructured":"L.G. Shapiro and R.M. Haralick. Organization of relational models for scene analysis. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 3, pages 595\u2013602, 1982.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"K. Sengupta and K.L. Boyer. Organizing large structural modelbases. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 17, 1995.","DOI":"10.1109\/34.385984"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"1979","DOI":"10.1016\/S0031-3203(98)90142-X","volume":"32","author":"B. Messmer","year":"1999","unstructured":"B. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism. In Pattern Recognition, volume 32, pages 1979\u20131998, 1999.","journal-title":"Pattern Recognition"},{"key":"25_CR13","unstructured":"J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann Publishers, 1993."},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"J.R. Ullman","year":"1976","unstructured":"J.R. Ullman. An algorithm for subgraph isomorphism. In JACM, volume 23(1), pages 31\u201342, 1976.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44522-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:47:38Z","timestamp":1556740058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44522-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679462","9783540445227"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-44522-6_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}