Learning Belief Functions from Data via Polyhedral Methods

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F25%3A00639114" target="_blank" >RIV/67985556:_____/25:00639114 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/67985807:_____/25:00639114

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Learning Belief Functions from Data via Polyhedral Methods

Popis výsledku v původním jazyce

We present a polyhedral framework for learning belief functions from data when empirical lower and upper probability bounds are obtained from Jeffreys’ binomial confidence intervals. Such bounds, interpreted as empirical belief and plausibility values for all subsets of the outcome space, generally yield a pseudo-belief function that may not correspond to any valid basic probability assignment (BPA) satisfying the axioms of Dempster–Shafer theory. nOur approach formulates the correction problem as a system of linear constraints in the BPA space, where the feasible solutions form a convex polyhedron of belief functions consistent with the empirical bounds. We investigate several linear optimization criteria for selecting a representative BPA from this feasible set, including L1-projection to the empirical lower bounds, Dubois–Prade entropy maximization, sparsity-oriented objectives, and cardinality-weighted allocations.

Název v anglickém jazyce

Learning Belief Functions from Data via Polyhedral Methods

Popis výsledku anglicky

We present a polyhedral framework for learning belief functions from data when empirical lower and upper probability bounds are obtained from Jeffreys’ binomial confidence intervals. Such bounds, interpreted as empirical belief and plausibility values for all subsets of the outcome space, generally yield a pseudo-belief function that may not correspond to any valid basic probability assignment (BPA) satisfying the axioms of Dempster–Shafer theory. nOur approach formulates the correction problem as a system of linear constraints in the BPA space, where the feasible solutions form a convex polyhedron of belief functions consistent with the empirical bounds. We investigate several linear optimization criteria for selecting a representative BPA from this feasible set, including L1-projection to the empirical lower bounds, Dubois–Prade entropy maximization, sparsity-oriented objectives, and cardinality-weighted allocations.

Druh

O - Ostatní výsledky

CEP obor

—

OECD FORD obor

10103 - Statistics and probability

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2025

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů