Affiliation:
1. Shijiazhuang Vocational Technology Institute
Abstract
Based on unconstrained optimization and genetic algorithm, this paper presents a constrained genetic algorithm (CGA) for learning Bayesian network structure. Firstly, an undirected graph is obtained by solving an unconstrained optimization problem. Then based on the undirected graph, the initial population is generated, and selection, crossover and mutation operators are used to learn Bayesian network structure. Since the space of generating the initial population is constituted by some candidate edges of the optimal Bayesian network, the initial population has good property. Compared with the methods which use genetic algorithm (GA) to learn Bayesian network structure directly, the proposed method is more efficiency.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. Pinto P C, Nagele A, Dejori M, et al. Using a local discovery ant algorithm for Bayesian network structure learning[J]. IEEE Trans on Evolutionary Computation, 2009, 13(4): 767-779.
2. Sangeeta B E, Shou-Ching S, Marco F R, et al. Use of Bayesian networks to probabilistically model and improve the likelihood of validation of microarray findings by RTPCR[J]. J of Biomedical Informatics, 2009, 42(2): 287-295.
3. Chow C K, Lin C N. Approximating discrete probability distribution with dependence tree[J]. IEEE Trans on Information Theory, 1968, 14(3): 462-467.
4. Sprites P, Glymour C. An algorithm for fast recovery of sparse causal graphs[J]. Social Science Computating Review, 1991, 9(1): 62-72.
5. Chen X W, Gopalakrishna A, Lin X T. Improving Bayesian network structure learning with mutual information-based node ordering in the algorithm[J]. IEEE Trans on Knowledge and Data Engineering, 2008, 20(5): 1-13.