Invariant Image Recognition by Zernike Moments
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Multi-Objective Optimization Using Evolutionary Algorithms
Multi-Objective Optimization Using Evolutionary Algorithms
Genetic Algorithms for Multiobjective Optimization: FormulationDiscussion and Generalization
Proceedings of the 5th International Conference on Genetic Algorithms
Classification of Web Documents Using a Graph Model
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
A fast technique for comparing graph representations with applications to performance evaluation
International Journal on Document Analysis and Recognition
Approximating the Nondominated Front Using the Pareto Archived Evolution Strategy
Evolutionary Computation
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
Multi-objective learning via genetic algorithms
IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
Reactive tabu search for measuring graph similarity
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
In this paper, a graph classification approach based on a multi-objective genetic algorithm is presented. The method consists in the learning of sets composed of synthetic graph prototypes which are used for a classification step. These learning graphs are generated by simultaneously maximizing the recognition rate while minimizing the confusion rate. Using such an approach the algorithm provides a range of solutions, the couples (confusion, recognition) which suit to the needs of the system. Experiments are performed on real data sets, representing 10 symbols. These tests demonstrate the interest to produce prototypes instead of finding representatives which simply belong to the data set.