发表机构
IMIBIC; Universidad de Córdoba; Universidad Loyola Andalucía（IMIBIC（初级保健临床流行病学研究部）; 科尔多瓦大学; 安达卢西亚洛约拉大学）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
研究有序分类问题，提出ADABORD框架，将类别顺序特性融入AdaBoost算法关键组件，在TOC-UCO库与七种方法比较，实验表明其显著优于竞品，尤其在多类数据集上，且公开代码等方便后续研究。
AI 中文摘要
有序分类（OC）处理类别遵循自然顺序的分类任务。尽管OC取得了进展，但许多现有方法未能充分利用顺序信息，将其视为名义分类，从而失去了性能潜力。本文介绍了ADABORD，一个专门为有序分类问题设计的AdaBoost框架。类别顺序特性被纳入著名的AdaBoost算法的两个关键组件：1）基本估计器，提出具有顺序基尼分裂准则的决策树；2）误差函数，用于在每个阶段更新样本权重以及最终集成模型中分类器的权重，由绝对排名概率得分给出，该度量兼顾了类别之间的顺序和距离。在TOC-UCO存储库（迄今为止最大的OC基准集合）上，ADABORD与七种最先进的方法进行了广泛比较。统计分析支持的实验结果表明，ADABORD显著优于竞争方法，特别是在具有五个或更多类别的数据集上，其中顺序结构更为明显。源代码以及所有实验协议均可公开获取，以确保可重复性并促进OC的未来研究。
英文摘要
Ordinal Classification (OC) deals with classification tasks where the classes follow a natural order. Despite the progress in OC, many existing approaches fail to fully leverage the ordinal information, treating the problem as nominal classification and thereby losing performance potential. In this work, ADABORD, an AdaBoost framework specifically designed for ordinal classification problems, is introduced. The ordinal nature of the classes is incorporated into two key components of the well-known AdaBoost algorithm: 1) the base estimator, where decision trees with the ordinal Gini splitting criterion are proposed; 2) the error function used to update sample weights at each stage and the weights of the classifier in the final ensemble model, given by the absolute ranked probability score, a measure that accounts for both the ordering and the distance between classes. ADABORD is extensively compared against seven state-of-the-art methods on the TOC-UCO repository, the largest benchmark collection for OC to date. The experimental results, supported by statistical analysis, show that ADABORD significantly outperforms competing methods, particularly on datasets with five or more classes, where the ordinal structure becomes more pronounced. Source code, along with all experimental protocols, is publicly available to ensure reproducibility and facilitate future research in OC.
Comments42 pages, 6 figures, 7 tables. Submitted to CS top tier journal
