Automatic Feature Selection by Genetic Algorithms
2001
The efficient and automatic selection of features from an initial raw data set is an optimization task met in numerous applications fields, e.g., multivariate data classification, analysis, and visualization. The reduction of the variable number reduces the detrimental effects of the well-known curse of dimensionality. However, finding of the optimum solution in the selection process by exhaustive search is infeasible, as the underlying optimization problem is NP-complete. Thus, search heuristics are commonly applied to find acceptable solutions with a feasible computational effort. In this work, genetic algorithms are applied, based on dedicated nonparametric cost functions and multiobjective optimization. The method was implemented in our general QuickCog environment. For practical applications, competitive results were achieved.
Keywords:
- Minimum redundancy feature selection
- Curse of dimensionality
- Genetic algorithm
- Raw data
- Truncation selection
- Artificial intelligence
- Genetic representation
- Pattern recognition
- Optimization problem
- Computer science
- Quality control and genetic algorithms
- Multi-objective optimization
- Feature selection
- Brute-force search
- Machine learning
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
7
References
2
Citations
NaN
KQI