.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Bayesian networks
Causal relation
Scoring function
Node ordering
K2 algorithm
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveThe Northern Sea Routes and Korea's Trade with Europe: Implications for Korea's Shipping Industry
OAAI
OAAIShareSaveStudies on flavonoid metabolism. Identification of the metabolities of (+)-catechin in rat urineOAAI
OAAIShareSaveShareSave
View more