On multivariate randomized classification trees: $l_0$-based sparsity, VC~dimension and decomposition methods
원문 초록
Decision trees are widely-used classification and regression models because of their interpretability and good accuracy. Classical methods such as CART are based on greedy approaches but a growing attention has recently been devoted to optimal decision trees. We investigate the nonlinear continuous optimization formulation proposed in Blanquero et al. (EJOR, vol. 284, 2020; COR, vol. 132, 2021) for (sparse) optimal randomized classification trees. Sparsity is important not only for feature selection but also to improve interpretability. We first consider alternative methods to sparsify such trees based on concave approximations of the $l_{0}$ ``norm". Promising results are obtained on 24 datasets in comparison with $l_1$ and $l_{\infty}$ regularizations. Then, we derive bounds on the VC dimension of multivariate randomized classification trees. Finally, since training is computationally challenging for large datasets, we propose a general decomposition scheme and an efficient version of it. Experiments on larger datasets show that the proposed decomposition method is able to significantly reduce the training times without compromising the accuracy.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Malware Classification Leveraging NLP & Machine Learning for Enhanced Accuracy
Margin-aware Fuzzy Rough Feature Selection: Bridging Uncertainty Characterization and Pattern Classification
An Interpretable Adaptive Multiscale Attention Deep Neural Network for Tabular Data
Bio-Inspired Feature Selection in Brain Disease Detection via an Improved Sparrow Search Algorithm
Feature Selection With Maximal Relevance and Minimal Supervised Redundancy
LLSF - Learning Label Specific Features for Multi-Label Classifcation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.