Bayesian network structure learning based on the chaotic particle swarm optimization algorithm.
The Bayesian network (BN) is a knowledge representation form, which has been proven to be valuable in the gene regulatory network reconstruction because of its capability of capturing causal relationships between genes. Learning BN structures from a database is a nondeterministic polynomial time (NP)-hard problem that remains one of the most exciting challenges in machine learning. Several heuristic searching techniques have been used to find better network structures. Among these algorithms, the classical K2 algorithm is the most successful. Nonetheless, the performance of the K2 algorithm is greatly affected by a prior ordering of input nodes. The proposed method in this paper is based on the chaotic particle swarm optimization (CPSO) and the K2 algorithm. Because the PSO algorithm completely entraps the local minimum in later evolutions, we combined the PSO algorithm with the chaos theory, which has the properties of ergodicity, randomness, and regularity. Experimental results show that the proposed method can improve the convergence rate of particles and identify networks more efficiently and accurately.
Key Laboratory of Advanced Design and Intelligent Computing, Dalian University, Ministry of Education, Dalian, China zhangq@dlu.edu.cn.
Q
Q
Zhang
Z
Z
Li
C J
CJ
Zhou
X P
XP
Wei
D000465:Algorithms; D001185:Artificial Intelligence; D001499:Bayes Theorem; D003198:Computer Simulation; D053263:Gene Regulatory Networks; D006657:Histones / Q000235:genetics; D006801:Humans; D008957:Models, Genetic; D017711:Nonlinear Dynamics
D006657:Histones