Distance-based decision tree algorithms for label ranking

Cláudio Rebelo de Sá*, Carla Rebelo, Carlos Soares, Arno Knobbe

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

8 Citations (Scopus)
5 Downloads (Pure)

Abstract

The problem of Label Ranking is receiving increasing attention from several research communities. The algorithms that have developed/adapted to treat rankings as the target object follow two different approaches: distribution-based (e.g., using Mallows model) or correlation-based (e.g., using Spearman’s rank correlation coefficient). Decision trees have been adapted for label ranking following both approaches. In this paper we evaluate an existing correlation-based approach and propose a new one, Entropy-based Ranking trees. We then compare and discuss the results with a distribution-based approach. The results clearly indicate that both approaches are competitive.

Original languageEnglish
Title of host publicationProgress in Artificial Intelligence
Subtitle of host publication17th Portuguese Conference on Artificial Intelligence, EPIA 2015, Proceedings
Place of PublicationCham
PublisherSpringer
Pages525-534
Number of pages10
ISBN (Electronic)978-3-319-23485-4
ISBN (Print)978-3-319-23484-7
DOIs
Publication statusPublished - 1 Jan 2015
Externally publishedYes
Event17th Portuguese Conference on Artificial Intelligence, EPIA 2015 - Coimbra, Portugal
Duration: 8 Sept 201511 Sept 2015
Conference number: 17

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume9273
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference17th Portuguese Conference on Artificial Intelligence, EPIA 2015
Abbreviated titleEPIA 2015
Country/TerritoryPortugal
CityCoimbra
Period8/09/1511/09/15

Keywords

  • n/a OA procedure

Fingerprint

Dive into the research topics of 'Distance-based decision tree algorithms for label ranking'. Together they form a unique fingerprint.

Cite this