Algorithms for feature selection: An evaluation
Douglas E. Zongker, Anil Kumar Jain · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · 1996
A large number of algorithms have been proposed for doing feature subset selection. The goal of this paper is to evaluate the quality of feature subsets generated by the various algorithms, and also compare their computational requirements. Our results show that the sequential forward floating selection (SFFS) algorithm, proposed by Pudil et al. (1994), dominates the other algorithms tested. This paper also illustrates the dangers of using feature selection in small sample size situations. It gives the results of applying feature selection to land use classification of SAR satellite images using four different texture models. Pooling features derived from different texture models, followed by a feature selection results in a substantial improvement in the classification accuracy. Application of feature selection to classification of handprinted characters illustrates the value of feature selection in reducing the number of features needed for classifier design.
Cited by 119 works. doi:10.1109/icpr.1996.546716
Authors
References
- Floating search methods in feature selection
- A Branch and Bound Algorithm for Feature Subset Selection
- Small sample size effects in statistical pattern recognition: recommendations for practitioners
- A NOTE ON GENETIC ALGORITHMS FOR LARGE-SCALE FEATURE SELECTION
- A note on genetic algorithms for large-scale feature selection
- Comparative study of techniques for large-scale feature selection
- A Problem of Dimensionality: A Simple Example
- Feature Set Search Alborithms
- Performance evaluation of shape matching via chord length distribution
- A comparative study of different classifiers for handprinted character recognition