How to randomly generate mass functions - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems Année : 2013

How to randomly generate mass functions

Résumé

As Dempster-Shafer theory spreads in different application fields, and as mass functions are involved in more and more complex systems, the need for algorithms randomly generating mass functions arises. Such algorithms can be used, for instance, to evaluate some statistical properties or to simulate the uncertainty in some systems (e.g., database content, training sets). As such random generation is often perceived as secondary, most of the proposed algorithms use straightforward procedures whose sample statistical properties can be difficult to characterize. Thus, although such algorithms produce randomly generated mass functions, they do not always produce what could be expected from them (for example, uniform sampling in the set of all possible mass functions). In this paper, we briefly review some well-known algorithms, explaining why their statistical properties are hard to characterize. We then provide relatively simple algorithms and procedures to perform efficient random generation of mass functions whose sampling properties are controlled.
Fichier non déposé

Dates et versions

hal-00867938 , version 1 (30-09-2013)

Identifiants

Citer

Thomas Burger, Sébastien Destercke. How to randomly generate mass functions. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 2013, 5, pp.645-673. ⟨10.1142/S0218488513500311⟩. ⟨hal-00867938⟩
126 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More