On the Greediness of Feature Selection Algorithms (1998)

by Kan Deng , Andrew W. Moore
Citations:3 - 0 self

Documents Related by Co-Citation

3335 Induction of Decision Trees – J. R. Quinlan - 1986
1023 Wrappers for feature subset selection – Ron Kohavi , George H. John - 1997
2 Irrelevant features and the subest selection problem – G John, R Kohavi, K Pfleger - 1994
2 The Gardens of Learning: A Vision for – Oliver G Selfridge - 1993
2 Consumer Behavior and the Practice of Marketing – K E Runyon - 1977
1 Document Mining Track”, INitiative for the Evaluation – Ludovic Denoyer, Patrick Gallinari - 2007
1 Salton and Michael Lesk, “Computer Evaluation of Indexing and Text – J Gerard - 1968
64 Efficiently Inducing Determinations: A Complete and Systematic Search Algorithm that Uses Optimal Pruning – Jeffrey C. Schlimmer - 1993
43 The Nature of Statistical Learning Theory (Springer-Verlag – V N VAPNIK - 1995
58 and Eibe Frank: “Data Mining: Practical machine learning tools and techniques”, 2nd Edition – Ian H Witten - 2005
1437 Making large-scale SVM learning practical – T Joachims - 1999
1625 Experiments with a New Boosting Algorithm – Yoav Freund, Robert E. Schapire - 1996
531 Approximate Statistical Tests for Comparing Supervised Classification Learning Algorithms – Thomas G. Dietterich - 1998
500 Neural network ensembles – L K Hansen, P Salamon - 1990
388 Learning to classify text using support vector machines: methods, theory, and algorithms – T Joachims - 2002
235 Subset Selection in Regression – A Miller - 2002
506 Perceptrons: An introduction to computational geometry – M Minsky, S Papert - 1988
1382 Random forests – Leo Breiman, E. Schapire - 2001
2 Open-ended approaches to science assessment using computers – M K Singley, H L Taft - 1995