返回
A partial correlation-based Bayesian network structure learning algorithm under linear SEM
DOI:10.1016/j.knosys.2011.04.005.png)
摘要
En 中文
A new algorithm, the PCB (partial correlation-based) algorithm, is presented for Bayesian network structure learning. The algorithm effectively combines ideas from local learning with partial correlation techniques. It reconstructs the skeleton of a Bayesian network based on partial correlation and then performs a greedy hill-climbing search to orient the edges. Specifically, we make three contributions. First, we prove that in a linear SEM (simultaneous equation model) with uncorrelated errors, when the datasets are generated by linear SEM, subject to arbitrary distribution disturbances, we can use partial correlation as the criterion of the Cl test. Second, we perform a series of experiments to find the best threshold value of the partial correlation. Finally, we show how partial correlation can be used in Bayesian network structure learning under linear SEM. The effectiveness of the method is compared with current state of the art methods on eight networks. A simulation shows that the PCB algorithm outperforms existing algorithms in both accuracy and run time. (C) 2011 Elsevier B.V. All rights reserved.
Keyword:
Partial correlation
Bayesian network
Structure learning
Local learning
Linear SEM (simultaneous equation model)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.2W
被引数:
4.5W
机构
引用论文
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性
Measuring the relationships among university, industry and other sectors in Japan's national innovation system: a comparison of new approaches with mutual information indicators
SCIENTOMETRICS
IF3.5
The max-min hill-climbing Bayesian network structure learning algorithm最大最小爬山贝叶斯网络结构学习算法
MACHINE LEARNING
IF2.9

