Wrappers for Feature Subset Selection

[1]  Catherine Blake,et al.  UCI Repository of machine learning databases , 1998 .

[2]  Ron Kohavi,et al.  Data Mining Using MLC a Machine Learning Library in C++ , 1996, Int. J. Artif. Intell. Tools.

[3]  George H. John Enhancements to the data mining process , 1997 .

[4]  Ron Kohavi,et al.  Bias Plus Variance Decomposition for Zero-One Loss Functions , 1996, ICML.

[5]  Christopher J. Merz,et al.  UCI Repository of Machine Learning Databases , 1996 .

[6]  Pedro M. Domingos,et al.  Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier , 1996, ICML.

[7]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1997, EuroCOLT.

[8]  Ron Kohavi,et al.  Wrappers for performance enhancement and oblivious decision graphs , 1995 .

[9]  Igor Kononenko,et al.  On Biases in Estimating Multi-Valued Attributes , 1995, IJCAI.

[10]  Ron Kohavi,et al.  A Study of Cross-Validation and Bootstrap for Accuracy Estimation and Model Selection , 1995, IJCAI.

[11]  R. Mike Cameron-Jones,et al.  Oversearching and Layered Search in Empirical Learning , 1995, IJCAI.

[12]  Steven Salzberg,et al.  Lookahead and Pathology in Decision Tree Induction , 1995, IJCAI.

[13]  Jerzy W. Bala,et al.  Hybrid Learning Using Genetic Algorithms and Decision Trees for Pattern Classification , 1995, IJCAI.

[14]  Ron Kohavi,et al.  Feature Subset Selection Using the Wrapper Method: Overfitting and Dynamic Search Space Topology , 1995, KDD.

[15]  Gregory M. Provan,et al.  A Comparison of Induction Algorithms for Selective and non-Selective Bayesian Classifiers , 1995, ICML.

[16]  William Nick Street,et al.  An Inductive Learning Approach to Prognostic Prediction , 1995, ICML.

[17]  Ron Kohavi,et al.  Automatic Parameter Selection by Minimizing Estimated Error , 1995, ICML.

[18]  Philip W. L. Fong A Quantitative Study of Hypothesis Selection , 1995, ICML.

[19]  Ron Kohavi,et al.  Supervised and Unsupervised Discretization of Continuous Features , 1995, ICML.

[20]  Ron Kohavi,et al.  The Power of Decision Tables , 1995, ECML.

[21]  Gregory M. Provan,et al.  Learning Bayesian Networks Using Feature Selection , 1995, AISTATS.

[22]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[23]  Michael J. Pazzani,et al.  Searching for Dependencies in Bayesian Classifiers , 1995, AISTATS.

[24]  David W. Aha,et al.  A Comparative Evaluation of Sequential Feature Selection Algorithms , 1995, AISTATS.

[25]  David J. Spiegelhalter,et al.  Machine Learning, Neural and Statistical Classification , 2009 .

[26]  P. Langley Selection of Relevant Features in Machine Learning , 1994 .

[27]  Thomas G. Dietterich,et al.  Learning Boolean Concepts in the Presence of Many Irrelevant Features , 1994, Artif. Intell..

[28]  Pat Langley,et al.  Oblivious Decision Trees and Abstract Cases , 1994 .

[29]  Pat Langley,et al.  Induction of Selective Bayesian Classifiers , 1994, UAI.

[30]  Paul E. Utgoff,et al.  An Improved Algorithm for Incremental Induction of Decision Trees , 1994, ICML.

[31]  David B. Skalak,et al.  Prototype and Feature Selection by Sampling and Random Mutation Hill Climbing Algorithms , 1994, ICML.

[32]  Rich Caruana,et al.  Greedy Attribute Selection , 1994, ICML.

[33]  Andrew W. Moore,et al.  Efficient Algorithms for Minimizing Cross Validation Error , 1994, ICML.

[34]  Ron Kohavi,et al.  Irrelevant Features and the Subset Selection Problem , 1994, ICML.

[35]  João Gama,et al.  Characterizing the Applicability of Classification Algorithms Using Meta-Level Learning , 1994, ECML.

[36]  Igor Kononenko,et al.  Estimating Attributes: Analysis and Extensions of RELIEF , 1994, ECML.

[37]  Charles E. Taylor Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Complex Adaptive Systems.John H. Holland , 1994 .

[38]  N. Fisher,et al.  Probability Inequalities for Sums of Bounded Random Variables , 1994 .

[39]  Anders Krogh,et al.  Neural Network Ensembles, Cross Validation, and Active Learning , 1994, NIPS.

[40]  Ron Kohavi Feature Subset Selection as Search with Probabilistic Estimates , 1994 .

[41]  David W. Aha,et al.  Feature Selection for Case-Based Classification of Cloud Types: An Empirical Comparison , 1994 .

[42]  Ron Kohavi,et al.  Useful Feature Subsets and Rough Set Reducts , 1994 .

[43]  Matthew L. Ginsberg,et al.  Essentials of Artificial Intelligence , 2012 .

[44]  Andrew W. Moore,et al.  Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation , 1993, NIPS.

[45]  Kenneth DeJong,et al.  Robust feature selection algorithms , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[46]  Claire Cardie,et al.  Using Decision Trees to Improve Case-Based Learning , 1993, ICML.

[47]  Baozong Yuan,et al.  A more efficient branch and bound algorithm for feature selection , 1993, Pattern Recognit..

[48]  Maciej Modrzejewski,et al.  Feature Selection Using Rough Sets Theory , 1993, ECML.

[49]  Peter D. Turney Exploiting Context When Learning to Classify , 1993, ECML.

[50]  M. Perrone Improving regression estimation: Averaging methods for variance reduction with extensions to general convex measure optimization , 1993 .

[51]  Zdzisław Pawlak,et al.  Rough sets. Present state and the future , 1993 .

[52]  Kenneth A. De Jong,et al.  Genetic algorithms as a tool for feature selection in machine learning , 1992, Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92.

[53]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[54]  Larry A. Rendell,et al.  The Feature Selection Problem: Traditional Methods and a New Algorithm , 1992, AAAI.

[55]  Pat Langley,et al.  An Analysis of Bayesian Classifiers , 1992, AAAI.

[56]  Usama M. Fayyad,et al.  The Attribute Selection Problem in Decision Tree Generation , 1992, AAAI.

[57]  Larry A. Rendell,et al.  A Practical Approach to Feature Selection , 1992, ML.

[58]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[59]  Wray L. Buntine,et al.  Learning classification trees , 1992 .

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

[61]  David H. Wolpert,et al.  Stacked generalization , 1992, Neural Networks.

[62]  David W. Aha,et al.  Tolerating Noisy, Irrelevant and Novel Attributes in Instance-Based Learning Algorithms , 1992, Int. J. Man Mach. Stud..

[63]  Elie Bienenstock,et al.  Neural Networks and the Bias/Variance Dilemma , 1992, Neural Computation.

[64]  A. Atkinson Subset Selection in Regression , 1992 .

[65]  John Foster Provost,et al.  Policies for the selection of bias in inductive machine learning , 1992 .

[66]  Justin Doak,et al.  An evaluation of feature selection methods and their application to computer security , 1992 .

[67]  David H. Wolpert,et al.  On the Connection between In-sample Testing and Generalization Error , 1992, Complex Syst..

[68]  R. Greiner Probabilistic Hill-climbing: Theory and Applications , 1992 .

[69]  William Frawley,et al.  Knowledge Discovery in Databases , 1991 .

[70]  Sebastian Thrun,et al.  The MONK''s Problems-A Performance Comparison of Different Learning Algorithms, CMU-CS-91-197, Sch , 1991 .

[71]  Thomas G. Dietterich,et al.  Learning with Many Irrelevant Features , 1991, AAAI.

[72]  Christopher G. Atkeson,et al.  Using locally weighted regression for robot learning , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[73]  Thomas G. Dietterich,et al.  Readings in Machine Learning , 1991 .

[74]  U. Fayyad On the induction of decision trees for multiple concept learning , 1991 .

[75]  Belur V. Dasarathy,et al.  Nearest neighbor (NN) norms: NN pattern classification techniques , 1991 .

[76]  Wojciech Ziarko,et al.  The Discovery, Analysis, and Representation of Data Dependencies in Databases , 1991, Knowledge Discovery in Databases.

[77]  L. Kaelbling Learning in embedded systems , 1993 .

[78]  Larry A. Rendell,et al.  Learning hard concepts through constructive induction: framework and rationale , 1990, Comput. Intell..

[79]  L. N. Kanal,et al.  Uncertainty in Artificial Intelligence 5 , 1990 .

[80]  Yoav Freund,et al.  Boosting a weak learning algorithm by majority , 1990, COLT '90.

[81]  Bojan Cestnik,et al.  Estimating Probabilities: A Crucial Task in Machine Learning , 1990, ECAI.

[82]  Pat Langley,et al.  Models of Incremental Concept Formation , 1990, Artif. Intell..

[83]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[84]  Mark S. Boddy,et al.  Solving Time-Dependent Planning Problems , 1989, IJCAI.

[85]  Chris Carter,et al.  Multiple decision trees , 2013, UAI.

[86]  Ronald L. Rivest,et al.  Training a 3-node neural network is NP-complete , 1988, COLT '88.

[87]  Lei Xu,et al.  Best first strategy for feature selection , 1988, [1988 Proceedings] 9th International Conference on Pattern Recognition.

[88]  J. Stephen Judd,et al.  On the complexity of loading shallow neural networks , 1988, J. Complex..

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

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

[91]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[92]  Alan J. Miller Sélection of subsets of regression variables , 1984 .

[93]  Leo Breiman,et al.  Classification and Regression Trees , 1984 .

[94]  Bernard M. E. Moret,et al.  Decision Trees and Diagrams , 1982, CSUR.

[95]  Moshe Ben-Bassat,et al.  35 Use of distance measures, information measures and error bounds in feature evaluation , 1982, Classification, Pattern Recognition and Reduction of Dimensionality.

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

[97]  N. Nilsson,et al.  Readings in Artificial Intelligence , 1981 .

[98]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[99]  Jan M. Van Campenhout,et al.  On the Possible Orderings in the Measurement Selection Problem , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

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

[101]  Ronald L. Rivest,et al.  Constructing Optimal Binary Decision Trees is NP-Complete , 1976, Inf. Process. Lett..

[102]  John Holland,et al.  Adaptation in Natural and Artificial Sys-tems: An Introductory Analysis with Applications to Biology , 1975 .

[103]  V. Barnett,et al.  Applied Linear Statistical Models , 1975 .

[104]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[105]  Richard O. Duda,et al.  Pattern classification and scene analysis , 1974, A Wiley-Interscience publication.

[106]  C. L. Mallows Some comments on C_p , 1973 .

[107]  Marvin Minsky,et al.  Perceptrons: An Introduction to Computational Geometry , 1969 .

[108]  D. M. Ellis,et al.  Applied Regression Analysis , 1968 .

[109]  Irving John Good,et al.  The Estimation of Probabilities: An Essay on Modern Bayesian Methods , 1965 .

[110]  Thomas Marill,et al.  On the effectiveness of receptors in recognition systems , 1963, IEEE Trans. Inf. Theory.

[111]  F ROSENBLATT,et al.  The perceptron: a probabilistic model for information storage and organization in the brain. , 1958, Psychological review.