Bayesian network learning algorithm based on independence test and ant colony optimization

Zidonghua Xuebao/ Acta Automatica Sinica

Volumn 35, Issue 3, 2009, Pages 281-288

  Ji, Jun Zhong ^a   Zhang, Hong Xun ^a   Hu, Ren Bing ^a   Liu, Chun Nian ^a  

^a BEIJING UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

Ant colony optimization (ACO); Bayesian network structure learning; Conditional independence test; Uncertainty modeling

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED PARAMETER NETWORKS; EDUCATION; HEURISTIC ALGORITHMS; HEURISTIC METHODS; INFERENCE ENGINES; INTELLIGENT NETWORKS; KNOWLEDGE BASED SYSTEMS; LEARNING ALGORITHMS; LEARNING SYSTEMS; OPTIMIZATION; SPEECH ANALYSIS; SPEECH RECOGNITION; STATISTICAL TESTS; TESTING;

ANT COLONY OPTIMIZATION (ACO); BAYESIAN NETWORK LEARNING; BAYESIAN NETWORK STRUCTURE LEARNING; BENCHMARK DATUM; CANDIDATE SOLUTIONS; CONDITIONAL INDEPENDENCE TEST; CONVERGENCE SPEED; GLOBAL SCORES; HEURISTIC FUNCTIONS; IMPROVED ALGORITHMS; INDEPENDENCE TESTS; LARGE-SCALE DATABASE; LEARNING BAYESIAN NETWORKS; MUTUAL INFORMATIONS; ORIGINAL ALGORITHMS; STOCHASTIC SEARCHES; UNCERTAINTY MODELING;

BAYESIAN NETWORKS;

EID: 63749120518     PISSN: 02544156     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1004.2009.00281     Document Type: Article

References (22)

1. Heckerman D. A Tutorial on Learning Bayesian Networks. Kluwer: Learning in Graphical Models, 1996. 301-354.
2. de Campos L M, Huete J F. A new approach for learning belief networks using independence criteria. International Journal of Approximate Reasoning, 2000, 24(1): 11-37.
3. Cheng J, Greiner R, Kelly J, Bell D, Liu W. Learning Bayesian networks from data: an information theory based approach. Artificial Intelligence, 2002, 137(1-2): 43-90.
4. Suzuki J. Learning Bayesian belief networks based on the minimum description length principle: basic properties. IEICE Transactions on Fundamentals, 1999, 82(10): 2237-2245.
5. Liu Da-You, Wang Fei, Lu Yi-Nan, Xue Wan-Xin, Wang Song-Xi. Research on learning Bayesian network structure based on genetic algorithms. Journal of Computer Research and Development, 2001, 38(8): 916-922 (in Chinese).
6. de Campos L M, Fernandez-Luna J M, Gamez J A, Puerta J M. Ant colony optimization for learning Bayesian networks. International Journal of Approximate Reasoning, 2002, 31(3): 291-311.
7. Larranaga P, Poza M, Yurramendi Y, Murga R H, Kuijpers C M H. Structure learning of Bayesian networks by genetic algorithms: a performance analysis of control parameters. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1996, 18(9): 912-926.
8. Wong M L, Lam W, Leung K S. Using evolutionary programming and minimum description length principle for data mining of Bayesian networks. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1999, 21(2): 174-178.
9. Jose A G, Jose M P. Searching for the best elimination sequence in Bayesian networks by using ant colony optimization. Pattern Recognition Letters, 2002, 23(1-3): 261-277.
10. Qiang Lei, Xiao Tian-Yuan, Qiao Gui-Xiu. An improved Bayesian networks learning algorithm. Journal of Computer Research and Development, 2002, 39(10): 1221-1226 (in Chinese).
11. Wong M L, Lee S Y, Leung K S. A hybrid approach to discover Bayesian networks from databases using evolutionary programming. In: Proceedings of IEEE International Conference on Data Mining. Japan: IEEE, 2002. 498-505.
12. Ji Jun-Zhong, Liu Chun-Nian, Yan Jing. A fast Bayesian network structure learning algorithm. Journal of Computer Research and Development, 2007, 44(3): 412-419 (in Chinese).
13. Wong M L, Leung K S. An efficient data mining method for learning Bayesian networks using an evolutionary algorithm-based hybrid approach. IEEE Transactions on Evolutionary Computation, 2004, 8(4): 378-404.
14. Mantin J, Jan N. A simulated annealing-based method for learning Bayesian networks from statistical data: research articles. International Journal of Intelligent Systems, 2006, 21(3): 335-348.
15. Tsamardinos I, Brown L E, Alieris C F. The max-min hill-climbing Bayesian network structure learning algorithm. Machine Learning, 2006, 65(1): 31-78.
16. Alcobe J R. Incremental hill-climbing search applied to Bayesian network structure learning. In: Proceedings of the 15th European Conference on Machine Learning. Pisa, Italy: IEEE, 2004. 1-10.
17. Dorigo M, Maniezzo V, Colorni A. The ant system: optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 1996, 26(1): 29-41.
18. Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 53-66.
19. Blum C, Dorigo M. Search bias in ant colony optimization: on the role of competition-balanced systems. IEEE Transactions on Evolutionary Computation, 2005, 9(2): 159-174.
20. Blum C, Dorigo M. The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 2004, 34(2): 1161-1172.
21. Stutzle T, Dorigo M. A short convergence proof for a class of ant colony optimization algorithms. IEEE Transactions on Evolutionary Computation, 2002, 6(4): 358-365.
22. Dorigo M, Birattari M, Stutzle T. Ant colony optimization: artificial ants as a computational intelligence technique. IEEE Computational Intelligence Magazine, 2006, 1(4): 28-39.