DICS: Data-Informed Centroid Splitting for Decision Tree Classifiers

arXiv:2608.20258v1 Announce Type: new Abstract: Decision tree-based models are widely used in machine learning due to their interpretability and strong empirical performance. However, training decision trees can be computationally expensive, particularly for large and high-dimensional datasets, largely due to the exhaustive search over candidate splits at each node. To improve computational efficiency, we propose Data-Informed Centroid Splitting (DICS), a clustering-based framework that constructs a compact and informative set of candidate splits using data-driven priors. By incorporating class-aware structure, DICS significantly reduces the split search space for classification tasks while preserving predictive performance. We further provide theoretical analysis showing that under the stated assumptions, DICS does not degrade the performance of classification trees compared to exhaustive split search. DICS can be incorporated into classification trees, random forests, and gradient-boosting models. Extensive experiments demonstrate that DICS achieves comparable accuracy while substantially reducing training time across synthetic and benchmark datasets, highlighting the benefit of integrating data-informed priors into split selection for scalable classification tree learning.

Related

• PINE: Pruning Boosted Tree Ensembles with Conformal In-Distribution Prediction Equivalence
• RCProb: Probabilistic Rule Extraction for Efficient Simplification of Tree Ensembles
• Local MDI+: Local Feature Importances for Tree-Based Models

Source: arXiv cs.LG | 2026-08-21