Graph Matching: Fast Candidate Elimination Using Machine Learning Techniques
Graph matching is an important class of methods in pattern recognition. Typically, a graph representing an unknown pattern is matched with a database of models. If the database of model graphs is large, an additional factor in induced into the overall complexity of the matching process. Various techniques for reducing the influence of this additional factor have been described in the literature. In this paper we propose to extract simple features from a graph and use them to eliminate candidate graphs from the database. The most powerful set of features and a decision tree useful for candidate elimination are found by means of the C4.5 algorithm, which was originally proposed for inductive learning of classification rules. Experimental results are reported demonstrating that efficient candidate elimination can be achieved by the proposed procedure.
Key wordsStructural pattern recognition graph matching graph isomorphism database retrieval database indexing machine learning C4.5
- 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.Google Scholar
- 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.Google Scholar
- 11.K. Sengupta and K.L. Boyer. Organizing large structural modelbases. In IEEE Trans. Pattern Analysis and Machine Intelligence, volume 17, 1995.Google Scholar
- 13.J. R. Quinlan. C4.5: Programs for machine learning. Morgan Kaufmann Publishers, 1993.Google Scholar