Graph matching: Fast candidate elimination using machine learning techniques

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1876 LNCS, Issue , 2000, Pages 236-245

  Lazarescu, M ^a,b   Bunke, H ^a   Venkatesh, S ^b  

^a UNIVERSITY OF BERN   (Switzerland)

^b CURTIN UNIVERSITY   (Australia)

Author keywords

C4.5; Database indexing; Database retrieval; Graph isomorphism; Graph matching; Machine learning; Structural pattern recognition

Indexed keywords

AUTOMATIC INDEXING; DATABASE SYSTEMS; DECISION TREES; LEARNING SYSTEMS; MACHINE LEARNING; PATTERN MATCHING; ARTIFICIAL INTELLIGENCE; DATA MINING; TREES (MATHEMATICS);

C4.5; DATABASE INDEXING; DATABASE RETRIEVAL; GRAPH ISOMORPHISM; GRAPH MATCHINGS; STRUCTURAL PATTERN RECOGNITION; MORPHISMS;

TREES (MATHEMATICS); PATTERN RECOGNITION;

EID: 84877760034     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44522-6_25     Document Type: Conference Paper

References (14)

1. L.G. Shapiro and R.M. Haralick. Structural descriptions and inexact matching. IEEE Trans. Pattern Analysis and Machine Intelligence, volume 3, pages 504-519, 1981.
2. 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-363, 1983.
3. 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-505, 1998.
4. 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-632, 1991.
5. 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-404, 1994.
6. 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'l J. Pattern Recognition and Artificial Intelligence, volume 4, no. 1, pages 1-15, 1990.
7. 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-117. World Scientific, 1998.
8. A. Pearce, T. Caelli, and W.F. Bischof. Rulegraphs for graph matching in pattern recognition. In Pattern Recognition, volume 27, no. 9, pages 1231-1246, 1994.
9. E.K. Wong. Model matching in robot vision by subgraph isomorphism. In Pattern Recognition, volume 25, no. 3, pages 287-304, 1992.
10. 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-602, 1982.
11. K. Sengupta and K.L. Boyer. Organizing large structural modelbases. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 17, 1995.
12. B. Messmer and H. Bunke. A decision tree approach to graph and subgraph isomorphism. In Pattern Recognition, volume 32, pages 1979-1998, 1999.
13. J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann Publishers, 1993.
14. J.R. Ullman. An algorithm for subgraph isomorphism. In JACM, volume 23(1), pages 31-42, 1976.