Dempster-Shafer approximations and probabilistic bounds in statistical matching

DOI10.1007/978-3-030-86772-0_27OpenAlexW3200969551MaRDI QIDQ2146037

Barbara Vantaggi, Davide Petturiti

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86772-0_27

zbMATH Keywords

inferencebelief functionsstatistical matching

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

Probability envelopes and their Dempster-Shafer approximations in statistical matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Set functions, games and capacities in decision making
• Partial identification in statistical matching with misclassification
• Updating beliefs with incomplete observations
• Notes on conditional previsions
• Finitely additive conditional probabilities, conglomerability and disintegrations
• Stochastic independence in a coherent setting
• Conditional belief functions as lower envelopes of conditional probabilities in a finite setting
• 2-monotone outer approximations of coherent lower probabilities
• Outer approximating coherent lower probabilities with belief functions
• Statistical matching of multiple sources: A look through coherence
• Constructing belief functions from sample data using multinomial confidence regions
• Statistical Matching
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Robust Statistics
• On the selection of an optimal outer approximation of a coherent lower probability

This page was built for publication: Dempster-Shafer approximations and probabilistic bounds in statistical matching