Learning Moral Graphs in Construction of High-Dimensional Bayesian Networks for Mixed Data
Bayesian networks have been widely used in many scientific fields for describing the conditional independence relationships for a large set of random variables. This letter proposes a novel algorithm, the so-called -learning algorithm, for learning moral graphs for high-dimensional Bayesian networks...
Saved in:
| Published in: | Neural computation Vol. 31; no. 6; p. 1183 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
01.06.2019
|
| Subjects: | |
| ISSN: | 1530-888X, 1530-888X |
| Online Access: | Get more information |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Bayesian networks have been widely used in many scientific fields for describing the conditional independence relationships for a large set of random variables. This letter proposes a novel algorithm, the so-called
-learning algorithm, for learning moral graphs for high-dimensional Bayesian networks. The moral graph is a Markov network representation of the Bayesian network and also the key to construction of the Bayesian network for constraint-based algorithms. The consistency of the
-learning algorithm is justified under the small-
, large-
scenario. The numerical results indicate that the
-learning algorithm significantly outperforms the existing ones, such as the PC, grow-shrink, incremental association, semi-interleaved hiton, hill-climbing, and max-min hill-climbing. Under the sparsity assumption, the
-learning algorithm has a computational complexity of
even in the worst case, while the existing algorithms have a computational complexity of
in the worst case. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| ISSN: | 1530-888X 1530-888X |
| DOI: | 10.1162/neco_a_01190 |