Hüllermeier, Eyke ; Fürnkranz, Johannes (2007)
On Minimizing the Position Error in Label Ranking.
Report, Bibliographie
Kurzbeschreibung (Abstract)
Conventional classification learning allows a classifier to make a one shot decision in order to identify the correct label. However, in many practical applications, the problem is not to give a single estimation, but to make repeated suggestions until the correct target label has been identified. Thus, the learner has to deliver a label ranking, that is, a ranking of all possible alternatives. In this paper, we discuss a loss function, called the position error, which is suitable for evaluating the performance of a label ranking algorithm in this setting. Moreover, we propose “ranking through iterated choice”, a general strategy for extending any multi-class classifier to this scenario. Its basic idea is to reduce label ranking to standard classification by successively predicting a most likely class label and retraining a model on the remaining classes. We demonstrate empirically that this procedure does indeed reduce the position error in comparison with a conventional approach that ranks the classes according to their estimated probabilities. Besides, we also address the issue of implementing ranking through iterated choice in a computationally efficient way.
Typ des Eintrags: | Report |
---|---|
Erschienen: | 2007 |
Autor(en): | Hüllermeier, Eyke ; Fürnkranz, Johannes |
Art des Eintrags: | Bibliographie |
Titel: | On Minimizing the Position Error in Label Ranking |
Sprache: | Englisch |
Publikationsjahr: | 2007 |
URL / URN: | http://www.ke.informatik.tu-darmstadt.de/publications/report... |
Kurzbeschreibung (Abstract): | Conventional classification learning allows a classifier to make a one shot decision in order to identify the correct label. However, in many practical applications, the problem is not to give a single estimation, but to make repeated suggestions until the correct target label has been identified. Thus, the learner has to deliver a label ranking, that is, a ranking of all possible alternatives. In this paper, we discuss a loss function, called the position error, which is suitable for evaluating the performance of a label ranking algorithm in this setting. Moreover, we propose “ranking through iterated choice”, a general strategy for extending any multi-class classifier to this scenario. Its basic idea is to reduce label ranking to standard classification by successively predicting a most likely class label and retraining a model on the remaining classes. We demonstrate empirically that this procedure does indeed reduce the position error in comparison with a conventional approach that ranks the classes according to their estimated probabilities. Besides, we also address the issue of implementing ranking through iterated choice in a computationally efficient way. |
ID-Nummer: | TUD-KE-2007-04 |
Fachbereich(e)/-gebiet(e): | 20 Fachbereich Informatik 20 Fachbereich Informatik > Knowledge Engineering |
Hinterlegungsdatum: | 24 Jun 2011 15:25 |
Letzte Änderung: | 26 Aug 2018 21:26 |
PPN: | |
Export: | |
Suche nach Titel in: | TUfind oder in Google |
Frage zum Eintrag |
Optionen (nur für Redakteure)
Redaktionelle Details anzeigen |