A pairwise label ranking method with imprecise scores and partial predictions

10Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we are interested in the label ranking problem. We are more specifically interested in the recent trend consisting in predicting partial but more accurate (i.e., making less incorrect statements) orders rather than complete ones. To do so, we propose a ranking method based on pairwise imprecise scores obtained from likelihood functions. We discuss how such imprecise scores can be aggregated to produce interval orders, which are specific types of partial orders. We then analyse the performances of the method as well as its sensitivity to missing data and parameter values. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Destercke, S. (2013). A pairwise label ranking method with imprecise scores and partial predictions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8189 LNAI, pp. 112–127). https://doi.org/10.1007/978-3-642-40991-2_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free