Genetic-based search for error-correcting graph isomorphism

Error-correcting graph isomorphism has been found useful in numerous pattern recognition applications. This paper presents a genetic-based search approach that adopts genetic algorithms as the searching criteria to solve the problem of error-correcting graph isomorphism. By applying genetic algorithms, some local search strategies are amalgamated to improve convergence speed. Besides, a selection operator is proposed to prevent premature convergence. The proposed approach has been implemented to verify its validity. Experimental results reveal the superiority of this new technique than several other well-known algorithms.

[1]  Andrew K. C. Wong,et al.  An algorithm for graph optimal monomorphism , 1990, IEEE Trans. Syst. Man Cybern..

[2]  K. Dejong,et al.  An analysis of the behavior of a class of genetic adaptive systems , 1975 .

[3]  Rajarshi Das,et al.  A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization , 1989, ICGA.

[4]  L. Kitchen.  Discrete Relaxation for Matching Relational Structures , 1978 .

[5]  L. Darrell Whitley,et al.  A Comparison of Genetic Sequencing Operators , 1991, ICGA.

[6]  David E. Goldberg,et al.  Finite Markov Chain Analysis of Genetic Algorithms , 1987, ICGA.

[7]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[8]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[9]  Ching Y. Suen,et al.  Hierarchical attributed graph representation and recognition of handwritten chinese characters , 1991, Pattern Recognit..

[10]  Les Kitchen,et al.  Relaxation Applied to Matching Quantitative Relational Structures , 1978 .

[11]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[12]  Kenneth A. De Jong,et al.  Using Genetic Algorithms to Solve NP-Complete Problems , 1989, ICGA.

[13]  Derek G. Corneil,et al.  The graph isomorphism disease , 1977, J. Graph Theory.

[14]  King-Sun Fu,et al.  Subgraph error-correcting isomorphisms for syntactic pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[15]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[16]  Kenneth Alan De Jong,et al.  An analysis of the behavior of a class of genetic adaptive systems. , 1975 .

[17]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[18]  Thomas Bäck,et al.  Extended Selection Mechanisms in Genetic Algorithms , 1991, ICGA.

[19]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.