A sparse structure learning algorithm for Gaussian Bayesian Network identification from high-dimensional data.
Structure learning of Bayesian Networks (BNs) is an important topic in machine learning. Driven by modern applications in genetics and brain sciences, accurate and efficient learning of large-scale BN structures from high-dimensional data becomes a challenging problem. To tackle this challenge, we propose a Sparse Bayesian Network (SBN) structure learning algorithm that employs a novel formulation involving one L1-norm penalty term to impose sparsity and another penalty term to ensure that the learned BN is a Directed Acyclic Graph--a required property of BNs. Through both theoretical analysis and extensive experiments on 11 moderate and large benchmark networks with various sample sizes, we show that SBN leads to improved learning accuracy, scalability, and efficiency as compared with 10 existing popular BN learning algorithms. We apply SBN to a real-world application of brain connectivity modeling for Alzheimer's disease (AD) and reveal findings that could lead to advancements in AD research.
School of Computing, Informatics, and Decision Systems Engineering, Arizona State University, PO Box 878809, Tempe, AZ 85287-8809, USA.
Shuai
S
Huang
Jing
J
Li
Jieping
J
Ye
Adam
A
Fleisher
Kewei
K
Chen
Teresa
T
Wu
Eric
E
Reiman
D000465:Algorithms; D000544:Alzheimer Disease / Q000235:genetics; D001185:Artificial Intelligence; D001499:Bayes Theorem; D001921:Brain / Q000378:metabolism; D020869:Gene Expression Profiling; D006801:Humans; D016011:Normal Distribution