Modelling and predicting partial orders from pairwise belief functions - Archive ouverte HAL Access content directly
Journal Articles Soft Computing Year : 2016

Modelling and predicting partial orders from pairwise belief functions

Abstract

In this paper, we introduce a generic way to represent and manipulate pairwise information about partial orders (representing rankings, preferences, ...) with belief functions. We provide generic and practical tools to make inferences from this pairwise information and illustrate their use on the machine learning problems that are label ranking and multi-label prediction. Our approach differs from most other quantitative approaches handling complete or partial orders, in the sense that partial orders are here considered as primary objects and not as incomplete specifications of ideal but unknown complete orders.
No file

Dates and versions

hal-01275513 , version 1 (17-02-2016)

Identifiers

Cite

Marie-Hélène Masson, Sébastien Destercke, Thierry Denoeux. Modelling and predicting partial orders from pairwise belief functions. Soft Computing, 2016, 20 (3), pp.939-950. ⟨10.1007/s00500-014-1553-9⟩. ⟨hal-01275513⟩
64 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More