返回
An analytical threshold for combining Bayesian Networks
DOI:10.1016/j.knosys.2019.03.014.png)
摘要
En 中文
Structural learning of Bayesian Networks (BNs) is an NP-hard problem, and the use of sub-optimal strategies is essential in domains involving many variables. One approach is the generation of multiple approximate structures and then reduce the ensemble to a representative structure. This can be performed by using the occurrence frequency (on the structures ensemble) as the criteria for accepting a dominant directed edge between two nodes and thus obtaining the single structure. In this paper, an analogy with an adapted one-dimensional random-walk was used for analytically deducing an appropriate decision threshold to such occurrence frequency. The obtained closed-form expression has been validated across the synthetic datasets applying the Matthews Correlation Coefficient (MCC) as the performance metric. In the experiments using a recent medical dataset, the resulting BN from the analytical cutoff-frequency captured the expected associations among nodes and also achieved better prediction performance than the BNs learned with neighbours thresholds to the computed. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Bayesian Networks learning
Model averaging
Robust structures
Analytical threshold
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
K
IF:
7.6
论文数:
1.3W
被引数:
4.5W
机构
引用论文
A parallel algorithm for Bayesian network structure learning from large data sets一种面向大数据集的贝叶斯网络结构学习并行算法
SBA-15:TiO2 nanocomposites: II. Direct and post-synthesis using acetylacetoneSBA-15:TiO2纳米复合材料: II。使用乙酰丙酮的直接和后合成
Exploiting efficient and effective lazy Semi-Bayesian strategies for text classification
NEUROCOMPUTING
IF6.5

