Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
C4.5: programs for machine learning
C4.5: programs for machine learning
The nature of statistical learning theory
The nature of statistical learning theory
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
The Design of Innovation: Lessons from and for Competent Genetic Algorithms
Asymptotic behaviors of support vector machines with Gaussian kernel
Neural Computation
Evaluation relaxation using substructural information and linear estimation
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Automated global structure extraction for effective local building block processing in XCS
Evolutionary Computation
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence)
Do not match, inherit: fitness surrogates for genetics-based machine learning techniques
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
A matrix approach for finding extrema: problems with modularity, hierarchy, and overlap
Classifier fitness based on accuracy
Evolutionary Computation
Learning concept classification rules using genetic algorithms
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 2
Learning Classifier Systems: Looking Back and Glimpsing Ahead
Learning Classifier Systems
| Hi-index | 0.00 |
This paper presents a learning methodology based on a substructural classification model to solve decomposable classification problems. The proposed method consists of three important components: (1) a structural model, which represents salient interactions between attributes for a given data, (2) a surrogate model, which provides a functional approximation of the output as a function of attributes, and (3) a classification model, which predicts the class for new inputs. The structural model is used to infer the functional form of the surrogate. Its coefficients are estimated using linear regression methods. The classification model uses a maximally-accurate, least-complex surrogate to predict the output for given inputs. The structural model that yields an optimal classification model is searched using an iterative greedy search heuristic. Results show that the proposed method successfully detects the interacting variables in hierarchical problems, groups them in linkages groups, and builds maximally accurate classification models. The initial results on non-trivial hierarchical test problems indicate that the proposed method holds promise and also shed light on several improvements to enhance the capabilities of the proposed method.