arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2401.09848math.OC
收藏

混合整数线性优化用于半监督最优分类树

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees

Trier University(特里尔大学)

Jan Pablo Burgard, Maria Eduarda Pinheiro, Martin Schmidt

AI总结:

针对半监督分类问题,提出一种混合整数线性优化模型,通过整合标记数据、未标记数据及类别规模信息来构建最优分类树,在偏置样本上提升了准确率和马修斯相关系数。

摘要:

决策树是解决分类问题最流行的方法之一,主要因其良好的可解释性。此外,由于近年来混合整数优化的进展,已有多个模型被提出用于计算最优分类树。其目标是,给定一组带标签的点,用超平面划分特征空间,并为所得划分的每个部分分配一个类别。然而在某些场景中,标签仅对给定点的子集可用。此外,该子集可能不具有代表性,例如调查中的自我选择情况。半监督决策树处理标记和未标记数据的设置,通常有助于增强结果的可靠性。此外,未公开的来源可能提供关于类别规模的额外信息。我们提出一个混合整数线性优化模型,用于计算半监督最优分类树,该模型涵盖了标记和未标记数据点以及二元分类中每个类别的总点数。我们的数值结果表明,与其他最优分类树相比,即使只有少量标记点可用,我们的方法在偏置样本上也能带来更好的准确率和更好的马修斯相关系数。

英文摘要:

Decision trees are one of the most popular methods for solving classification problems, mainly because of their good interpretability properties. Moreover, due to advances in recent years in mixed-integer optimization, several models have been proposed to formulate the problem of computing optimal classification trees. The goal is, given a set of labeled points, to split the feature spacewith hyperplanes and assign a class to each part of the resulting partition. In certain scenarios, however, labels are only available for a subset of the given points. Additionally, this subset may be non-representative, such as in the case of self-selection in a survey. Semi-supervised decision trees tackle the setting of labeled and unlabeled data and often contribute to enhancing the reliability of the results. Furthermore, undisclosed sources may provide extra information about the size of the classes. We propose a mixed-integer linear optimization model for computing semi-supervised optimal classification trees that cover the setting of labeled and unlabeled data points as well as the overall number of points in each class for a binary classification. Our numerical results show that our approach leads to a better accuracy and a better Matthews correlation coefficient for biased samples compared to other optimal classification trees, even if onlyfew labeled points are available.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑