A Node Sorting Method for K2 Algorithm in Bayesian Network Structure Learning

Bayesian network is an important model for reasoning in an uncertain environment. A reliable node rank is required by K2 algorithm to learn Bayesian network structure better. To provide a high-quality node rank tailored for K2 algorithm, we propose a node priority-based sorting algorithm. Given observable data only, our algorithm can be employed to learn a node rank without expert knowledge. Specifically, MCMC algorithm is first utilized to yield some Bayesian network structures that can sufficiently fit the observed data. We then define the priority of each node in these network structures. Node rank is finally obtained through weighted scoring based on the priority. The empirical results show that our sorting algorithm performs significantly better than commonly used methods, e.g., randomly sorting and MCMC algorithm, on an Asia network-learning dataset.

[1]  Xue-wen Chen,et al.  Improving Bayesian Network Structure Learning with Mutual Information-Based Node Ordering in the K2 Algorithm , 2008, IEEE Transactions on Knowledge and Data Engineering.

[2]  Ya-fei LIU,et al.  Bayesian Reinforcement Learning for Multiscale Combinatorial Grouping , 2017 .

[3]  A. Priya,et al.  An Algorithm for Security Enhancement in Image Transmission Using Steganography , 2019, Journal of the Institute of Electronics and Computer.

[4]  Vahid Rezaei Tabar,et al.  Finding a set of candidate parents using dependency criterion for the K2 algorithm , 2018, Pattern Recognit. Lett..

[5]  Constantin F. Aliferis,et al.  The max-min hill-climbing Bayesian network structure learning algorithm , 2006, Machine Learning.

[6]  Dae-Won Kim,et al.  An efficient node ordering method using the conditional frequency for the K2 algorithm , 2014, Pattern Recognit. Lett..

[7]  Hua Yu,et al.  Poison Identification Based on Bayesian Network: A Novel Improvement on K2 Algorithm via Markov Blanket , 2013, ICSI.

[8]  V. R. Prakash An Enhanced Coding Algorithm for Efficient Video Coding , 2019, Journal of the Institute of Electronics and Computer.

[9]  Hamid Pezeshk,et al.  Some node ordering methods for the K2 algorithm , 2018, Comput. Intell..

[10]  David Maxwell Chickering,et al.  Learning Equivalence Classes of Bayesian Network Structures , 1996, UAI.

[11]  Nan Wu,et al.  Resource-efficient utilization of CPU/GPU-based heterogeneous supercomputers for Bayesian phylogenetic inference , 2013, The Journal of Supercomputing.