.png){kind=icon}
返回
An efficient node ordering method using the conditional frequency for the K2 algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.patrec.2013.12.021.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In Bayesian networks, the K2 algorithm is one of the most effective structure-learning methods. However, because the performance of the K2 algorithm depends on node ordering, more effective node ordering inference methods are needed. In this paper, we therefore introduce a new node ordering algorithm based on a novel scoring function. Because a child has a better conditional frequency or probability under a correct parent than an incorrect one, we have designed a novel scoring function to evaluate this conditional frequency. Given two variables, our scoring function infers which is the better parent variable. Consequently, the proposed method infers candidate parents by considering all pairs of variables; it then uses these parents as input for the K2 algorithm. Experimental results indicate that our proposed method outperforms previous methods. (C) 2014 Elsevier B. V. All rights reserved.
Keyword:
Bayesian networks
Causal relation
Scoring function
Node ordering
K2 algorithm
期刊
IF:
3.3
论文数:
7.9K
被引数:
1.6W
机构
引用论文
.png){kind=icon}
分享收藏The Northern Sea Routes and Korea's Trade with Europe: Implications for Korea's Shipping Industry
OAAI
OAAI分享收藏Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性OAAI
OAAI分享收藏Studies on flavonoid metabolism. Identification of the metabolities of (+)-catechin in rat urineOAAI
OAAI分享收藏分享收藏
查看更多内容