论文信息 - A note on genetic algorithms for large-scale feature selection

A note on genetic algorithms for large-scale feature selection

Abstract We introduce the use of genetic algorithms (GA) for the selection of features in the design of automatic pattern classifiers. Our preliminary results suggest that GA is a powerful means of reducing the time for finding near-optimal subsets of features from large sets.

Jack Sklansky | Wojciech W. Siedlecki | J. Sklansky | W. Siedlecki

[1] John H. Holland,et al. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[2] Jack Sklansky,et al. On Automatic Feature Selection , 1988, Int. J. Pattern Recognit. Artif. Intell..

[3] Jack Sklansky,et al. Feature Selection for Automatic Classification of Non-Gaussian Data , 1987, IEEE Transactions on Systems, Man, and Cybernetics.

[4] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[5] Jack Sklansky,et al. Pattern Classifiers and Trainable Machines , 1981 .

[6] Anil K. Jain,et al. 39 Dimensionality and sample size considerations in pattern recognition practice , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

[7] Josef Kittler,et al. Pattern recognition : a statistical approach , 1982 .

[8] Keinosuke Fukunaga,et al. A Branch and Bound Algorithm for Feature Subset Selection , 1977, IEEE Transactions on Computers.