An improvement of Random Node Generator for the uniform generation of capacities - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Annals of Mathematics and Artificial Intelligence Année : 2023

An improvement of Random Node Generator for the uniform generation of capacities

Peiqi Sun
Michel Grabisch

Résumé

Capacity is an important tool in decision-making under risk and uncertainty and multi-criteria decision-making. When learning a capacity-based model, it is important to be able to generate uniformly a capacity. Due to the monotonicity constraints of a capacity, this task reveals to be very difficult. The classical Random Node Generator (RNG) algorithm is a fast-running speed capacity generator, however with poor performance. In this paper, we firstly present an exact algorithm for generating a n elements' general capacity, usable when n < 5. Then, we present an improvement of the classical RNG by studying the distribution of the value of each element of a capacity. Furthermore, we divide it into two cases, the first one is the case without any conditions, and the second one is the case when some elements have been generated. Experimental results show that the performance of this improved algorithm is much better than the classical RNG while keeping a very reasonable computation time.
Fichier sous embargo
Fichier sous embargo
0 1 19
Année Mois Jours
Avant la publication
lundi 24 juin 2024
Fichier sous embargo
lundi 24 juin 2024
Connectez-vous pour demander l'accès au fichier

Dates et versions

hal-04356826 , version 1 (20-12-2023)

Identifiants

Citer

Peiqi Sun, Michel Grabisch, Christophe Labreuche. An improvement of Random Node Generator for the uniform generation of capacities. Annals of Mathematics and Artificial Intelligence, 2023, ⟨10.1007/s10472-023-09911-9⟩. ⟨hal-04356826⟩
7 Consultations
12 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More