Label Ranking Forests

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

*Corresponding author for this work

    Research output: Contribution to journalArticleAcademicpeer-review

    8 Citations (Scopus)

    Abstract

    The problem of Label Ranking is receiving increasing attention from several research communities. The algorithms that have been developed/adapted to treat rankings of a fixed set of labels as the target object, including several different types of decision trees (DT). One DT-based algorithm, which has been very successful in other tasks but which has not been adapted for label ranking is the Random Forests (RF) algorithm. RFs are an ensemble learning method that combines different trees obtained using different randomization techniques. In this work, we propose an ensemble of decision trees for Label Ranking, based on Random Forests, which we refer to as Label Ranking Forests (LRF). Two different algorithms that learn DT for label ranking are used to obtain the trees. We then compare and discuss the results of LRF with standalone decision tree approaches. The results indicate that the method is highly competitive.

    Original languageEnglish
    Article numbere12166
    JournalExpert systems
    Volume34
    Issue number1
    DOIs
    Publication statusPublished - 1 Feb 2017

    Keywords

    • Decision Trees
    • Label Ranking
    • Random Forests

    Fingerprint Dive into the research topics of 'Label Ranking Forests'. Together they form a unique fingerprint.

    Cite this