This paper considers the problem of approximating an arbitrary belief function in Dempster-Shafer theory, seen as the imprecise distribution of a random variable with finite range, with a suitable p-box. The quoted p-box is asked to minimize a Choquet-Wasserstein pseudo-distance while satisfying inequality constraints on the corresponding lower/upper quantile function. We show that the computation of the approximating p-box can be carried out efficiently through a generalization of the Dykstra’s algorithm by relying on a proper entropic formulation.
Quantile-constrained Choquet-Wasserstein p-box approximation of arbitrary belief functions
A. Cinfrignini,Silvia Lorenzini,Davide Petturiti,B. Vantaggi
Published 2025 in IEEE International Conference on Fuzzy Systems
ABSTRACT
PUBLICATION RECORD
- Publication year
2025
- Venue
IEEE International Conference on Fuzzy Systems
- Publication date
2025-07-06
- Fields of study
Mathematics, Computer Science
- Identifiers
- External record
- Source metadata
Semantic Scholar
CITATION MAP
EXTRACTION MAP
CLAIMS
- No claims are published for this paper.
CONCEPTS
- No concepts are published for this paper.
REFERENCES
Showing 1-24 of 24 references · Page 1 of 1
CITED BY
- No citing papers are available for this paper.
Showing 0-0 of 0 citing papers · Page 1 of 1