Analysis of the generalization ability of a full decision tree
From MaRDI portal
Publication:2940504
Recommendations
Cites work
- scientific article; zbMATH DE number 4170917 (Why is no real title available?)
- scientific article; zbMATH DE number 3664426 (Why is no real title available?)
- scientific article; zbMATH DE number 1931832 (Why is no real title available?)
- scientific article; zbMATH DE number 3446442 (Why is no real title available?)
- 10.1162/153244303321897690
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Classification based on full decision trees
- Combining Pattern Classifiers
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Generalization error of combined classifiers.
- On the density of families of sets
- Rademacher penalties and structural risk minimization
- Random forests
Cited in
(8)- A procedure for improving generalization in classification trees
- Decision trees do not generalize to new variations
- Machine Learning: ECML 2004
- Classification based on full decision trees
- Making decision trees feasible in ultrahigh feature and label dimensions
- Inductive Logic Programming
- Probabilistic characterization of random decision trees
- Enlarging the margins in perceptron decision trees
This page was built for publication: Analysis of the generalization ability of a full decision tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940504)