A New Algorithm for Learning Large Bayesian Network Structure From Discrete Data
Learning the structure of Bayesian networks (BNs) from high dimensional discrete data is common nowadays but a challenging task, due to the large parameter space, the acyclicity constraint placed on the graphical structures and the difficulty in searching for a sparse structure. In this article, we...
Main Authors: | Weiping Zhang, Ziqiang Xu, Yu Chen, Jing Yang |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2019-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/8813012/ |
Similar Items
-
Robust Bayesian Regression with Synthetic Posterior Distributions
by: Shintaro Hashimoto, et al.
Published: (2020-06-01) -
Learning Large-Scale Bayesian Networks with the sparsebn Package
by: Bryon Aragam, et al.
Published: (2019-11-01) -
Two-step variable selection in quantile regression models
by: FAN Yali
Published: (2015-06-01) -
Priority-Lasso: a simple hierarchical approach to the prediction of clinical outcome using multi-omics data
by: Simon Klau, et al.
Published: (2018-09-01) -
Genomic growth curves of an outbred pig population
by: Fabyano Fonseca e Silva, et al.
Published: (2013-01-01)