.png){kind=icon}
返回
Learning decision trees for the partial label ranking problem
.png){kind=icon}
OA
AI
DOI：10.1002/int.22325.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Label Ranking (LR) problem is a well-known nonstandard supervised classification problem, the goal of which is to learn preference classifiers from data, mapping instances to rankings of the labels of the class variable. In the literature, the particular setting where the output of the LR problem is a complete ranking without ties (a.k.a. permutation) has been profusely studied, and many algorithms have been designed to solve these particular instances based on the use of specific probability distributions and aggregation methods for permutations. However, also partial orders (a.k.a. bucket orders) can be considered as output in LR problems (i.e., some labels of the class variable may be tied), but the algorithms available do not tackle this kind of ranking. We refer to this particular case of LR as the Partial Label Ranking (PLR) problem. Thus, motivated by the lack of current methods to deal with the PLR problem, we design machine learning algorithms based on instance-based and decision tree approaches to tackle the PLR problem. We evaluate our proposals on a benchmark of 15 data sets obtained by transforming multiclass instances, and analyze their performance by carrying out a standard machine learning statistical analysis procedure.
Keyword:
decision trees
instance‐ based learning
label ranking problem
partial label ranking problem
supervised classification
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.7
论文数:
3.1K
被引数:
8.1K
机构
引用论文
Approaching rank aggregation problems by using evolution strategies: The case of the optimal bucket order problem使用进化策略解决秩聚合问题: 以最佳桶序问题为例OAAI
OAAI分享收藏分享收藏Dyad ranking using Plackett-Luce models based on joint feature representations.png)
MACHINE LEARNINGOAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏
查看更多内容