A genetic classification error method for speech recognition
Signal Processing
A neural net compiler system for hierarchical organization
ACM SIGPLAN Notices
AFSS '02 Proceedings of the 2002 AFSS International Conference on Fuzzy Systems. Calcutta: Advances in Soft Computing
Neural, Parallel & Scientific Computations
ACODF: a novel data clustering approach for data mining in large databases
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Multiobjective Optimization in Bioinformatics and Computational Biology
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Multicriteria decision making (MCDM): a framework for research and applications
IEEE Computational Intelligence Magazine
Self-organizing potential field network: a new optimization algorithm
IEEE Transactions on Neural Networks
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
International Journal of Swarm Intelligence Research
Hi-index | 0.00 |
We present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical learning. Our approach of “learning-follows-decomposition” is a generic solution to complex high-dimensional problems where the input space is partitioned prior to the hierarchical neural domain instead of by competitive learning. In this technique, clusters are generated on the basis of fitness of purpose. Results of partitioning pattern spaces are presented. This strategy of preprocessing the data and explicitly optimizing the partitions for subsequent mapping onto a hierarchical classifier is found both to reduce the learning complexity and the classification time with no degradation in overall classification error rate. The classification performance of various algorithms is compared and it is suggested that the neural modules are superior for learning the localized decision surfaces of such partitions and offer better generalization