Decision tree classification with bounded number of errors

DOI10.1016/J.IPL.2017.06.011MaRDI QIDQ2398501zbMATH OpenOpenAlexFDO

Authors Aline Saettler, Eduardo S. Laber, Felipe de A. Mello Pereira

Publication date 16 August 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2017.06.011

zbMATH Keywords

approximation algorithmsdecision treesfeature selectionrandomized algorithms

Mathematics Subject Classification ID

Randomized algorithms (68W20) Approximation algorithms (68W25)

Recommendations

• Feature minimization within decision trees
• On the Difficulty of Designing Good Classifiers
• Approximating Decision Trees with Multiway Branches
• Algorithmic Learning Theory
• Decision trees with at most 19 vertices for knowledge representation

Cites work

• Adaptive submodularity: theory and applications in active learning and stochastic optimization
• An analysis of the greedy algorithm for the submodular set covering problem
• Approximation algorithms for stochastic Boolean function evaluation and stochastic submodular set cover
• Average-case active learning with costs
• Group-Based Active Query Selection for Rapid Diagnosis in Time-Critical Situations
• scientific article; zbMATH DE number 1754596 (Why is no real title available?)
• Learning with attribute costs
• The optimal sample complexity of PAC learning

Cited in

(1)

• Relationships between Average Depth and Number of Misclassifications for Decision Trees

This page was built for publication: Decision tree classification with bounded number of errors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2398501)