IEEE Transactions on Pattern Analysis and Machine Intelligence
The partition-combination method for recognition of handwritten characters
Pattern Recognition Letters
Automatic Recognition of Handwritten Numerical Strings: A Recognition and Verification Strategy
IEEE Transactions on Pattern Analysis and Machine Intelligence
Handwritten Numerical Recognition Using Autoassociative Neural Networks
ICPR '98 Proceedings of the 14th International Conference on Pattern Recognition-Volume 1 - Volume 1
Optimizing Nearest Neighbour in Random Subspaces using a Multi-Objective Genetic Algorithm
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 1 - Volume 01
Sequential genetic search for ensemble feature selection
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Designing classifier fusion systems by genetic algorithms
IEEE Transactions on Evolutionary Computation
Solving the traveling salesman problem with annealing-based heuristics: a computational study
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Multi-objective genetic algorithms have been often used to optimize classification systems, but little is discussed on their computational cost to solve such problems. This paper optimizes a classification system with an annealing based approach, the Record-to-Record Travel algorithm. Results obtained are compared to those obtained with a multi-objective genetic algorithm in the same approach. Experiments are performed with isolated handwritten digits and uppercase letters, demonstrating both the effectiveness and lower computational cost of the annealing based approach.