.png){kind=icon}
返回
On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2022.106058.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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. (2020) for training 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 l0 norm. Promising results are obtained on 24 datasets in comparison with the original l1 and l infinity 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 node-based decomposition scheme and a practical version of it. Experiments on larger datasets show that the proposed decomposition method is able to significantly reduce the training times without compromising the testing accuracy.
Keyword:
Machine Learning
Randomized classification trees
Sparsity
Decomposition methods
Nonlinear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
The influence of quinones and phenols on the triple NAD(H)-dependent enzyme systems.png)
Chemosphere
ChemosphereIF0
PREAI
分享收藏
查看更多内容