.png){kind=icon}
返回
Efficient methods for learning Bayesian network super-structures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.10.035.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Learning large Bayesian networks (BN) from data is a challenging problem due to the vastness of the structure space. An effective way to turn this problem affordable is the use of super-structures SS (undirected graphs that contain the BN skeleton). However, the literature has been lacking of specialized methods for estimating SS. We present here two algorithms intended for such purpose in the hybrid approach of BN structure learning. The first one, called Opt01SS, learns SS using only zero-and-first-order conditional independence (Cl) tests in a way that allows dealing with the presence of approximate-deterministic relationships and inconsistent CIs, commonly found in small samples. The second algorithm, called OptHPC, is a computational optimized version of the recent HPC algorithm (De Morais and Aussem 2010, [17]) that showed an attractive accuracy for SS recovery. Results on various benchmark networks showed that the proposed algorithms achieve a balance between sensitivity and specificity clearly more favorable for the task of SS estimation than several representative state-of-the-art methods. The computational cost was also found to be reasonable, being Opt01SS one of the most competitive among the analyzed algorithms. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Bayesian networks
Structure learning
Super-structure
期刊
IF:
6.5
论文数:
2.5W
被引数:
7.8W
机构
引用论文
Effects of Time-Restricted Eating on Weight Loss and Other Metabolic Parameters in Women and Men With Overweight and Obesity限时进食对超重和肥胖男性和女性体重减轻和其他代谢参数的影响
OAAI
OAAI分享收藏分享收藏The max-min hill-climbing Bayesian network structure learning algorithm最大最小爬山贝叶斯网络结构学习算法.png)
MACHINE LEARNING
OAAI
MACHINE LEARNINGIF2.9
OAAI分享收藏分享收藏 没有更多内容
没有更多内容