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.
|Number of pages||10|
|Journal||IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics|
|State||Published - 1997|
- Error-correcting graph isomorphism
- Genetic algorithms