HOW TO RANDOMLY GENERATE MASS FUNCTIONS

DOI10.1142/S0218488513500311zbMath1323.68485OpenAlexW2131163584MaRDI QIDQ3449265

Sebastien Destercke, Thomas Burger

Publication date: 4 November 2015

Published in: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218488513500311

zbMATH Keywords

Dempster-Shafer theoryrandom generationsimulation algorithm

Mathematics Subject Classification ID

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

Related Items (7)

Idempotent conjunctive and disjunctive combination of belief functions by distance minimization ⋮ Multiscale probability transformation of basic probability assignment ⋮ Decomposition of conflict as a distribution on hypotheses in the framework on belief functions ⋮ Complementary Lipschitz continuity results for the distribution of intersections or unions of independent random sets in finite discrete spaces ⋮ Approximate Inference in Directed Evidential Networks with Conditional Belief Functions Using the Monte Carlo Algorithm ⋮ Several shades of conflict ⋮ Interpreting evidential distances by connecting them to partial orders: application to belief function approximation

Cites Work

• Distances in evidence theory: comprehensive survey and generalizations
• Reduction of uncertainty using sensitivity analysis methods for infinite random sets of indexable type
• \(k\)-order additive discrete fuzzy measures and their representation
• The transferable belief model
• Approximation algorithms and decision making in the Dempster-Shafer theory of evidence---an empirical study
• A definition of subjective possibility
• Unifying practical uncertainty representations. II. Clouds
• The combination of multiple classifiers using an evidential reasoning approach

This page was built for publication: HOW TO RANDOMLY GENERATE MASS FUNCTIONS