Random generation of mass functions: A short howto - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Random generation of mass functions: A short howto

Résumé

As Dempster-Shafer theory spreads in application fields involving complex systems, the need for algorithms randomly generating mass functions arises. As this problem is often perceived as secondary, most proposed algorithms use procedures whose sample statistical properties are difficult to characterize. Thus, although they produce randomly generated mass functions, it is difficult to control the sample statistical laws. In this paper, we briefly review classical algorithms, explaining why their statistical properties are hard to characterize, and then provide simple procedures to perform efficient and controlled random generation.

Dates et versions

hal-00664325 , version 1 (30-01-2012)

Identifiants

Citer

Thomas Burger, Sébastien Destercke. Random generation of mass functions: A short howto. 2nd International Conference on Belief Functions (BELIEF 2012), 2012, Compiègne, France. pp.145-152, ⟨10.1007/978-3-642-29461-7_17⟩. ⟨hal-00664325⟩
108 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More