Analysis of the generalization ability of a full decision tree
DOI10.1134/S0965542514060074zbMATH Open1313.68194OpenAlexW2065862578MaRDI QIDQ2940504FDOQ2940504
Authors: I. E. Genrikhov 
Publication date: 26 January 2015
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0965542514060074
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Random forests
- Boosting the margin: a new explanation for the effectiveness of voting methods
- On the density of families of sets
- Title not available (Why is that?)
- Combining Pattern Classifiers
- Empirical margin distributions and bounding the generalization error of combined classifiers
- 10.1162/153244303321897690
- Title not available (Why is that?)
- Rademacher penalties and structural risk minimization
- Title not available (Why is that?)
- Generalization error of combined classifiers.
- Title not available (Why is that?)
- Classification based on full decision trees
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
Uses Software
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)
