Label ranking oblique trees
Label ranking studies the problem of learning a preference model that maps instances to rankings over a finite set of predefined class labels. The training data used to solve this problem consists of instances labeled with rankings. Since these rankings are often incomplete, models need to be able t...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universidad de Castilla-La Mancha |
| Repositorio: | RUIdeRA. Repositorio Institucional de la UCLM |
| OAI Identifier: | oai:ruidera.uclm.es:10578/43408 |
| Acceso en línea: | https://doi.org/10.1016/j.knosys.2024.111882 https://www.sciencedirect.com/science/article/pii/S0950705124005161?via%3Dihub https://hdl.handle.net/10578/43408 |
| Access Level: | acceso abierto |
| Palabra clave: | Label ranking Machine learning Oblique decision tree Preference learning |
| Sumario: | Label ranking studies the problem of learning a preference model that maps instances to rankings over a finite set of predefined class labels. The training data used to solve this problem consists of instances labeled with rankings. Since these rankings are often incomplete, models need to be able to deal with missing information in the class labels to be more useful in practice. Several decision tree models have been proposed to learn from incomplete rankings, mainly using axis-parallel decision nodes, which is the standard approach for decision tree induction. In contrast to this strategy, this present work introduces a method for learning oblique decision trees for the label ranking problem, as they have been shown to improve performance in the standard classification scenario. Our experimentation shows that this method offers several advantages over the current decision tree model. Not only does it generate more compact tree structures, but it is also shown to achieve outstandingly better results for complete rankings and in cases with a low percentage of missing labels. Moreover, the proposed method is faster in the largest datasets than the current decision tree model. |
|---|