Complete search for feature selection in decision trees
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244303322753616
- 10.1162/153244303322753715
- Asymptotics for and against cross-validation
- Do we need hundreds of classifiers to solve real world classification problems?
- Estimating classification error rate: repeated cross-validation, repeated hold-out and bootstrap
- Feature extraction. Foundations and applications. Papers from NIPS 2003 workshop on feature extraction, Whistler, BC, Canada, December 11--13, 2003. With CD-ROM.
- Handling missing values when applying classification models
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 1906319 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
- On the Possible Orderings in the Measurement Selection Problem
- Optimal classification trees
- Selection of relevant features and examples in machine learning
- The algorithm design manual
- Wrappers for feature subset selection
Cited in
(7)- Feature minimization within decision trees
- Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
- On sparse optimal regression trees
- Basic theory of feature trees
- The independent component analysis with the linear regression – predicting the energy costs of the public sector buildings in Croatia
- Who Are We Missing? : A Principled Approach to Characterizing the Underrepresented Population
- Mathematical optimization in classification and regression trees
This page was built for publication: Complete search for feature selection in decision trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5214189)