Computer systems that learn: classification and prediction methods from statistics, neural nets, machine learning, and expert systems
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Incremental Learning with Respect to New Incoming Input Attributes
Neural Processing Letters
Problem Decomposition and the Learning of Skills
ECML '95 Proceedings of the 8th European Conference on Machine Learning
Improving Supervised Learning by Feature Decomposition
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
Decomposition of Heterogeneous Classification Problems
IDA '97 Proceedings of the Second International Symposium on Advances in Intelligent Data Analysis, Reasoning about Data
Parallel Non Linear Dichotomizers
IJCNN '00 Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN'00)-Volume 2 - Volume 2
Learning concept classification rules using genetic algorithms
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
GA-fuzzy modeling and classification: complexity and performance
IEEE Transactions on Fuzzy Systems
IEEE Transactions on Neural Networks
IEEE Transactions on Neural Networks
Efficient classification for multiclass problems using modular neural networks
IEEE Transactions on Neural Networks
Hierarchical Incremental Class Learning with Reduced Pattern Training
Neural Processing Letters
Hi-index | 0.00 |
Genetic algorithm (GA) has been used as a conventional method for classifiers to evolve solutions adaptively for classification problems. In this paper, a new approach using class decomposition is proposed to improve the performance of GA-based classifiers. A classification problem is fully partitioned into several class modules in the output domain and each module is responsible for solving a fraction of the original problem. These modules are trained in parallel and independently and the results obtained are integrated and evolved further for a final solution. A scheme based on Fisher's linear discriminant (FLD) computation is used to estimate the difficulty of separating two classes. Based on the FLD information derived, different integration approaches are proposed and their performance is compared. The experiment results on a benchmark data set show that class decomposition can achieve higher classification rate than the normal GA and FLD-based integration improves the classification accuracy further.