An experimental evaluation of simplicity in rule learning
From MaRDI portal
Recommendations
- Including a simplicity criterion in the selection of the best rule in a genetic fuzzy learning algorithm
- On the quest for optimal rule learning heuristics
- scientific article; zbMATH DE number 67792
- Complexity of rule sets induced by two versions of the MLEM2 rule induction algorithm
- An analytical comparison of some rule-learning programs
Cites work
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 4166895 (Why is no real title available?)
- scientific article; zbMATH DE number 1179314 (Why is no real title available?)
- scientific article; zbMATH DE number 1391397 (Why is no real title available?)
- Application of information theory to the construction of efficient decision trees
- Constructing optimal binary decision trees is NP-complete
- Learning in the Presence of Malicious Errors
- On the difficulty of approximately maximizing agreements.
- Separate-and-conquer rule learning
- Statistical comparisons of classifiers over multiple data sets
- Trading accuracy for simplicity in decision trees
- Very simple classification rules perform well on most commonly used datasets
Cited in
(6)- Including a simplicity criterion in the selection of the best rule in a genetic fuzzy learning algorithm
- Learning certifiably optimal rule lists for categorical data
- Finding a short and accurate decision rule in disjunctive normal form by exhaustive search
- Evaluating six candidate solutions for the small-disjunct problem and choosing the best solution via meta-learning
- scientific article; zbMATH DE number 4166893 (Why is no real title available?)
- An analytical comparison of some rule-learning programs
This page was built for publication: An experimental evaluation of simplicity in rule learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2389614)