Classification Trees for Imbalanced Data: Surface-to-Volume Regularization
From MaRDI portal
Publication:6077565
Abstract: Classification algorithms face difficulties when one or more classes have limited training data. We are particularly interested in classification trees, due to their interpretability and flexibility. When data are limited in one or more of the classes, the estimated decision boundaries are often irregularly shaped due to the limited sample size, leading to poor generalization error. We propose a novel approach that penalizes the Surface-to-Volume Ratio (SVR) of the decision set, obtaining a new class of SVR-Tree algorithms. We develop a simple and computationally efficient implementation while proving estimation consistency for SVR-Tree and rate of convergence for an idealized empirical risk minimizer of SVR-Tree. SVR-Tree is compared with multiple algorithms that are designed to deal with imbalance through real data applications.
Cites work
- Asymptotical minimax recovery of sets with smooth boundaries
- Bayesian regression tree models for causal inference: regularization, confounding, and heterogeneous effects (with discussion)
- Consistency of random forests
- Fast learning rates for plug-in classifiers
- Hellinger distance decision trees are robust and skew-insensitive
- scientific article; zbMATH DE number 3860199 (Why is no real title available?)
- scientific article; zbMATH DE number 1753143 (Why is no real title available?)
- Introduction to algorithms.
- Minimax-optimal classification with dyadic decision trees
This page was built for publication: Classification Trees for Imbalanced Data: Surface-to-Volume Regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077565)