DocumentCode
2805854
Title
Markov Structure Random Sampler (MSRS) Algorithm from Unrestricted Discrete Graphic Markov Models
Author
Díaz, Elva Díaz ; Ponce De Leon Senti, Eunice Esther
Author_Institution
Universidad Autonoma de Aguascalientes, Mexico
fYear
2006
fDate
Nov. 2006
Firstpage
199
Lastpage
206
Abstract
In this paper a new model random sampler algorithm, only based on the interaction structure of the model is presented. It means that the vector values of the parameters of the distribution are not needed to perform the sample generation. The algorithm is tested generating nine structure models of 10, 12, and 14 variables, and conditional independence restrictions with structures, sparse, mean and dense. Eight random samples are generated from each structure model, for a total of 72 random samples. To validate the results an external criterion is used. Every sample is given to the model selection algorithm implemented in MIM software, which obtains the structure of the departure model for 93% of the samples. In all cases the generation time of a sample was not greater than 4 minutes. The mean run time grows with the density of the models. The MSRS algorithm converges in at most 4 iterations.
Keywords
Artificial intelligence; Convergence; Genetic algorithms; Graphics; Probability distribution; Random number generation; Random variables; Sampling methods; Software algorithms; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Artificial Intelligence, 2006. MICAI '06. Fifth Mexican International Conference on
Conference_Location
Mexico City, Mexico
Print_ISBN
0-7695-2722-1
Type
conf
DOI
10.1109/MICAI.2006.30
Filename
4022153
Link To Document