.png){kind=icon}
返回
New optimization models for optimal classification trees
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2023.106515.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The most efficient state-of-the-art methods to build classification trees are greedy heuristics (e.g. CART) that may fail to find underlying characteristics in datasets. Recently, exact linear formulations that have shown better accuracy were introduced. However they do not scale up to datasets with more than a few thousands data points. In this paper, we introduce four new formulations for building optimal trees. The first one is a quadratic model based on the well-known formulation of Bertsimas et al. We then propose two different linearizations of this new quadratic model. The last model is an extension to real -valued datasets of a flowformulation limited to binary datasets (Aghaei et al.). Each model is introduced for both axis -aligned and oblique splits. We further prove that our new formulations have stronger continuous relaxations than existing models. Finally, we present computational results on 22 standard datasets with up to thousands of data points. Our exact models have reduced solution times with learning performances as strong or significantly better than state of the art exact approaches.
Keyword:
Combinatorial optimization
Optimal classification trees
Mixed binary programming
Quadratic programming
Linearizations
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Are female CEOs more risk averse than male counterparts? Evidence from Vietnam女性ceo比男性同行更厌恶风险吗？越南的证据
PREAI
分享收藏分享收藏
查看更多内容