Label Ranking with Abstention: Predicting Partial Orders by Thresholding Probability Distributions (Extended Abstract)

12/02/2011
by   Weiwei Cheng, et al.
0

We consider an extension of the setting of label ranking, in which the learner is allowed to make predictions in the form of partial instead of total orders. Predictions of that kind are interpreted as a partial abstention: If the learner is not sufficiently certain regarding the relative order of two alternatives, it may abstain from this decision and instead declare these alternatives as being incomparable. We propose a new method for learning to predict partial orders that improves on an existing approach, both theoretically and empirically. Our method is based on the idea of thresholding the probabilities of pairwise preferences between labels as induced by a predicted (parameterized) probability distribution on the set of all rankings.

READ FULL TEXT
research
10/16/2022

Skeptical inferences in multi-label ranking with sets of probabilities

In this paper, we consider the problem of making skeptical inferences fo...
research
04/19/2019

Reliable Multi-label Classification: Prediction with Partial Abstention

In contrast to conventional (single-label) classification, the setting o...
research
10/25/2019

Learning Mixtures of Plackett-Luce Models from Structured Partial Orders

Mixtures of ranking models have been widely used for heterogeneous prefe...
research
06/22/2021

Credal Self-Supervised Learning

Self-training is an effective approach to semi-supervised learning. The ...
research
02/14/2012

Efficient Probabilistic Inference with Partial Ranking Queries

Distributions over rankings are used to model data in various settings s...
research
12/14/2020

Trustworthy Preference Completion in Social Choice

As from time to time it is impractical to ask agents to provide linear o...

Please sign up or login with your details

Forgot password? Click here to reset