Floating search methods in feature selection
Pattern Recognition Letters
Fusion of handwritten word classifiers
Pattern Recognition Letters - Special issue on fuzzy set technology in pattern recognition
The Random Subspace Method for Constructing Decision Forests
IEEE Transactions on Pattern Analysis and Machine Intelligence
Soft combination of neural classifiers: a comparative study
Pattern Recognition Letters
Ensemble learning via negative correlation
Neural Networks
Feature selection with neural networks
Pattern Recognition Letters
Image Representations and Feature Selection for Multimedia Database Search
IEEE Transactions on Knowledge and Data Engineering
Kernel Methods for Pattern Analysis
Kernel Methods for Pattern Analysis
Selecting salient features for classification based on neural network committees
Pattern Recognition Letters
Neural Computing and Applications
Multiple feature sets based categorization of laryngeal images
Computer Methods and Programs in Biomedicine
Neural Computing and Applications
Classifier combination based on confidence transformation
Pattern Recognition
Selecting variables for neural network committees
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Evolutionary ensembles with negative correlation learning
IEEE Transactions on Evolutionary Computation
Orthogonal forward selection and backward elimination algorithms for feature subset selection
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
The main emphasis of the technique developed in this work for evolving committees of support vector machines (SVM) is on a two phase procedure to select salient features. In the first phase, clearly redundant features are eliminated based on the paired t-test comparing the SVM output sensitivity-based saliency of the candidate and the noise feature. In the second phase, the genetic search integrating the steps of training, aggregation of committee members, and hyper-parameter as well as feature selection into the same learning process is employed. A small number of genetic iterations needed to find a solution is the characteristic feature of the genetic search procedure developed. The experimental tests performed on five real world problems have shown that significant improvements in correct classification rate can be obtained in a small number of iterations if compared to the case of using all the features available.