.png){kind=icon}
返回
Optimal randomized classification trees
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105281.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Classification and Regression Trees (CARTS) are off-the-shelf techniques in modern Statistics and Machine Learning. CARTs are traditionally built by means of a greedy procedure, sequentially deciding the splitting predictor variable(s) and the associated threshold. This greedy approach trains trees very fast, but, by its nature, their classification accuracy may not be competitive against other state-of-the-art procedures. Moreover, controlling critical issues, such as the misclassification rates in each of the classes, is difficult. To address these shortcomings, optimal decision trees have been recently proposed in the literature, which use discrete decision variables to model the path each observation will follow in the tree. Instead, we propose a new approach based on continuous optimization. Our classifier can be seen as a randomized tree, since at each node of the decision tree a random decision is made. The computational experience reported demonstrates the good performance of our procedure.
Keyword:
Classification and regression trees
Cost-sensitive classification
Nonlinear programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Awareness of activity limitations, goal setting and rehabilitation outcome in patients with brain injuries.png)
Brain Injury
Brain InjuryIF0
PREAI
分享收藏The effect of teaching prosody awareness on interpreting performance: an experimental study of consecutive interpreting from English into FarsiPerspectivesOAAI
PerspectivesIF0
OAAI分享收藏
分享收藏
查看更多内容