Skip Navigation

IEICE Transactions on Information and Systems 2008 E91-D(1):32-43; doi:10.1093/ietisy/e91-d.1.32
This Article
Right arrow Full Text (PDF)
Right arrow References
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Request Permissions
Google Scholar
Right arrow Articles by LEE, J.
Right arrow Articles by KIM, E.
Right arrow Search for Related Content
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Copyright © 2008 The Institute of Electronics, Information and Communication Engineers

Regular Section -- Papers -- Artificial Intelligence and Cognitive Science

Structure Learning of Bayesian Networks Using Dual Genetic Algorithm*

Jaehun LEE1, Wooyong CHUNG1 and Euntai KIM2

1 The authors are with the CILAB, School of Electrical and Electronic Engineering, Yonsei University, 134, Shinchon-Dong, Sudaemun-ku, Seoul 120–749, Korea. E-mail: etkim{at}yonsei.ac.kr, 2 The author is with the School of Electrical and Electronic Engineering, Yonsei University, 134, Shinchon-Dong, Sudaemun-ku, Seoul 120–749, Korea.


   Abstract

A new structure learning approach for Bayesian networks (BNs) based on dual genetic algorithm (DGA) is proposed in this paper. An individual of the population is represented as a dual chromosome composed of two chromosomes. The first chromosome represents the ordering among the BN nodes and the second represents the conditional dependencies among the ordered BN nodes. It is rigorously shown that there is no BN structure that cannot be encoded by the proposed dual genetic encoding and the proposed encoding explores the entire solution space of the BN structures. In contrast with existing GA-based structure learning methods, the proposed method learns not only the topology of the BN nodes, but also the ordering among the BN nodes, thereby, exploring the wider solution space of a given problem than the existing method. The dual genetic operators are closed in the set of the admissible individuals. The proposed method is applied to real-world and benchmark applications, while its effectiveness is demonstrated through computer simulation.

Key Words: Bayesian network, genetic algorithms, structure learning, dual chromosomes


Manuscript received July 27, 2006. Manuscript revised June 25, 2007.

* This work was supported by the Ministry of Commerce, Industry and Energy of Korea (HISP).


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.