Abstract
In order to deal with a large number of attributes, probabilistic feature selection algorithms have been proposed. Pure random walk entails mediocre performance in terms of search time. Introducing adaptiveness into a probabilistic algorithm can lead to a more focused search that results in a better search time. We compare two algorithms in search of an efficient but not myopic algorithm for feature selection. Based on the comparative study, we suggest some ways of improvement towards an evolutionary feature selection algorithm for data mining.
Original language | English (US) |
---|---|
Title of host publication | Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999 |
Publisher | IEEE Computer Society |
Pages | 1309-1313 |
Number of pages | 5 |
Volume | 2 |
DOIs | |
State | Published - 1999 |
Externally published | Yes |
Event | 1999 Congress on Evolutionary Computation, CEC 1999 - Washington, DC, United States Duration: Jul 6 1999 → Jul 9 1999 |
Other
Other | 1999 Congress on Evolutionary Computation, CEC 1999 |
---|---|
Country/Territory | United States |
City | Washington, DC |
Period | 7/6/99 → 7/9/99 |
ASJC Scopus subject areas
- Computational Mathematics