Binary Split Categorical Feature with Mean Absolute Error Criteria in CART
Abstract
In the context of the Classification and Regression Trees (CART) algorithm, the efficient splitting of categorical features using standard criteria like GINI and Entropy is wellestablished. However, using the Mean Absolute Error (MAE) criterion for categorical features has traditionally relied on various numerical encoding methods. This paper demonstrates that unsupervised numerical encoding methods are not viable for the MAE criteria. Furthermore, we present a novel and efficient splitting algorithm that addresses the challenges of handling categorical features with the MAE criterion. Our findings underscore the limitations of existing approaches and offer a promising solution to enhance the handling of categorical data in CART algorithms.
Ask Lune
Know this paper in minutes, not an afternoon.
Lune can read every page of it and the top-tier papers that cite it, and gives you its claims, its evidence and its limits, each one cited to the paper it comes from. No skimming, no AI slop.
Related papers
- Sparse Learning with CARTJason M. KlusowskiNeurIPS 2020 · 31 citations
- Optimal Classification Trees for Continuous Feature Data Using Dynamic Programming with Branch-and-BoundCatalin E. Brita, Jacobus G. M. van der Linden, Emir DemirovicAAAI 2025 · 5 citations
- Bivariate Decision Trees: Smaller, Interpretable, More AccurateRasul Kairgeldin, Miguel Á. Carreira-PerpiñánKDD 2024 · 1 citation
- Debiased Causal Tree: Heterogeneous Treatment Effects Estimation with Unmeasured ConfoundingCaizhi Tang, Huiyuan Wang, Xinyu Li, Qing Cui et al.NeurIPS 2022 · 12 citations
- Universal guarantees for decision tree induction via a higher-order splitting criterionGuy Blanc, Neha Gupta, Jane Lange, Li-Yang TanNeurIPS 2020 · 9 citations
