A Pairwise Label Ranking Method with Imprecise Scores and Partial Predictions
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.
Cite
Text
Destercke. "A Pairwise Label Ranking Method with Imprecise Scores and Partial Predictions." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013. doi:10.1007/978-3-642-40991-2_8Markdown
[Destercke. "A Pairwise Label Ranking Method with Imprecise Scores and Partial Predictions." European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases, 2013.](https://mlanthology.org/ecmlpkdd/2013/destercke2013ecmlpkdd-pairwise/) doi:10.1007/978-3-642-40991-2_8BibTeX
@inproceedings{destercke2013ecmlpkdd-pairwise,
title = {{A Pairwise Label Ranking Method with Imprecise Scores and Partial Predictions}},
author = {Destercke, Sébastien},
booktitle = {European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases},
year = {2013},
pages = {112-127},
doi = {10.1007/978-3-642-40991-2_8},
url = {https://mlanthology.org/ecmlpkdd/2013/destercke2013ecmlpkdd-pairwise/}
}