For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
A New Bayesian Network Structure Learning Algorithm Mechanism Based on the Decomposability of Scoring Functions
Guoliang LI Lining XING Zhongshan ZHANG Yingwu CHEN
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2017/07/01
Online ISSN: 1745-1337
Type of Manuscript: PAPER
Category: Graphs and Networks
Bayesian network, structure learning, mutual information, the decomposability of score functions, binary particle swarm optimization,
Full Text: PDF(1.2MB)
>>Buy this Article
Bayesian networks are a powerful approach for representation and reasoning under conditions of uncertainty. Of the many good algorithms for learning Bayesian networks from data, the bio-inspired search algorithm is one of the most effective. In this paper, we propose a hybrid mutual information-modified binary particle swarm optimization (MI-MBPSO) algorithm. This technique first constructs a network based on MI to improve the quality of the initial population, and then uses the decomposability of the scoring function to modify the BPSO algorithm. Experimental results show that, the proposed hybrid algorithm outperforms various other state-of-the-art structure learning algorithms.