Graphics enhanced version of this site

On the Greediness of Feature Selection Algorithms
K. Deng and A. Moore
International Conference of Machine Learning (ICML '98), June, 1998.

Jump to: Download | Abstract | Text Reference | BibTeX Reference

Adobe portable document format (pdf) [67 KB]
Compressed postscript (ps.gz) [185 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Based on our analysis and experiments using real-world datasets, we find that the greediness of forward feature selection algorithms does not severely corrupt the accuracy of function approximation using the selected input features, but improves the efficiency significantly. Hence, we propose three greedier algorithms in order to further enhance the efficiency of the feature selection processing. We provide empirical results for linear regression, locally weighted regression and k-nearest-neighbor models. We also propose to use these algorithms to develop an offline Chinese and Japanese handwriting recognition system with auto matically configured, local models.

K. Deng and A. Moore, "On the Greediness of Feature Selection Algorithms," International Conference of Machine Learning (ICML '98), June, 1998.

@inproceedings{Deng_1998_2820,
   author = "Kan Deng and Andrew Moore",
   title = "On the Greediness of Feature Selection Algorithms",
   booktitle = "International Conference of Machine Learning (ICML '98)",
   month = "June",
   year = "1998"
}