Regularized impurity reduction: accurate decision trees with complexity guarantees

DOI10.1007/S10618-022-00884-7MaRDI QIDQ6486128zbMATH OpenFDO

Authors Guangyi Zhang, Aristides Gionis

Publication date 9 January 2023

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10618-022-00884-7

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Recommendations

• Algorithmic Learning Theory
• Trading accuracy for simplicity in decision trees
• Minimax-optimal classification with dyadic decision trees
• On the boosting ability of top-down decision tree learning algorithms
• scientific article; zbMATH DE number 1256765

Cited in

(2)

• On Tackling Explanation Redundancy in Decision Trees
• Building more accurate decision trees with the additive tree

This page was built for publication: Regularized impurity reduction: accurate decision trees with complexity guarantees

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