Name
Abstract | ||
|---|---|---|
This paper presents new methods for generation of random Bayesian networks. Such methods can be used to test inference and learning algorithms for Bayesian networks, and to obtain insights on average properties of such networks. Any method that generates Bayesian networks must first generate directed acyclic graphs (the "structure" of the network) and then, for the generated graph, conditional probability distributions. No algorithm in the literature currently offers guarantees concerning the distribution of generated Bayesian networks. Using tools from the theory of Markov chains, we propose algorithms that can generate uniformly distributed samples of directed acyclic graphs. We introduce methods for the uniform generation of multi-connected and singly-connected networks for a given number of nodes; constraints on node degree and number of arcs can be easily imposed. After a directed acyclic graphis uniformly generated, the conditional distributions are produced by sampling Dirichlet distributions. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-36127-8_35 | SBIA |
Keywords | Field | DocType |
acyclic graphis,average property,acyclic graph,conditional distribution,bayesian network,bayesian networks,conditional probability distribution,random bayesian network,random generation,new method,markov chain,uniform generation,directed acyclic graph,dirichlet distribution | Random graph,Computer science,Directed acyclic graph,Bayesian network,Artificial intelligence,Degree distribution,Chain rule (probability),Bayesian statistics,Dirichlet distribution,Graphical model,Machine learning | Conference |
Volume | ISSN | ISBN |
2507 | 0302-9743 | 3-540-00124-7 |
Citations | PageRank | References |
28 | 2.00 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jaime S. Ide | 1 | 52 | 7.82 |
| Fabio G. Cozman | 2 | 1200 | 172.21 |