ACM Home Page
Please provide us with feedback. Feedback
Bayesian network structure learning using cooperative coevolution
Full text PdfPdf (486 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 9: genetic algorithms table of contents
Pages 755-762  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Olivier Barriàre  INRIA, Saclay, France
Evelyne Lutton  INRIA, Saclay, France
Pierre-Henri Wuillemin  LIP6, Paris, France
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 58,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570006
What is a DOI?

ABSTRACT

We propose a cooperative-coevolution - Parisian trend - algorithm, IMPEA (Independence Model based Parisian EA), to the problem of Bayesian networks structure estimation. It is based on an intermediate stage which consists of evaluating an independence model of the data to be modelled. The Parisian cooperative coevolution is particularly well suited to the structure of this intermediate problem, and allows to represent an independence model with help of a whole population, each individual being an independence statement, i.e. a component of the independence model. Once an independence model is estimated, a Bayesian network can be built. This two level resolution of the complex problem of Bayesian network structure estimation has the major advantage to avoid the difficult problem of direct acyclic graph representation within an evolutionary algorithm, which causes many troubles related to constraints handling and slows down algorithms. Comparative results with a deterministic algorithm, PC, on two test cases (including the Insurance BN benchmark), prove the efficiency of IMPEA, which provides better results than PC in a comparable computation time, and which is able to tackle more complex issues than PC.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
D. M. Chickering and C. Boutilier. Learning equivalence classes of Bayesian-network structures. In Journal of Machine Learning Research pages 150--157. Morgan Kaufmann, 1996.
 
5
 
6
C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory 14(3):462--467, 1968.
 
7
 
8
 
9
O. Francois and P. Leray. Etude comparative d 'algorithmes d 'apprentissage de structure dans les réseaux Bayésiens. In Rencontres des Jeunes Chercheurs en IA 2003.
 
10
 
11
N. Friedman, M. Linial, I. Nachman, and D. Pe 'er. Using Bayesian Network to Analyze Expression Data. J. Computational Biology 7:601--620, 2000.
 
12
 
13
H. Jia, D. Liu, and P. Yu. Learning dynamic Bayesian network with immune evolutionary algorithm. 2005
 
14
 
15
 
16
 
17
K. Murphy. The Bayes Net Toolbox for Matlab. Computing Science and Statistics 33(2):1024--1034, 2001.
 
18
J. W. Myers, K. B. Laskey, and K. A. DeJong. Learning Bayesian Networks from Incomplete Data using Evolutionary Algorithms. In Genetic and Evolutionary Computation Conference volume1, pages 458--465. Morgan Kaufmann, 1999.
 
19
G. Ochoa, E. Lutton, and E. Burke. The Cooperative Royal Road:Avoiding Hitchhiking. In Artificial Evolution pages 184--195, 2007.
 
20
J. Pearl and T. Verma. A theory of inferred causation. In Second International Conference on the Principles of Knowledge Representation and Reasoning 1991.
 
21
R. W. Robinson. Counting unlabeled acyclic digraphs. Combinatorial mathematics V 622:28--43, 1977.
 
22
 
23
P. Spirtes, C. Glymour, and R. Scheines. Causation, Prediction, and Search The MIT Press, second edition, 2001.
 
24
A. Tucker and X. Liu. Extending Evolutionary Programming Methods to the Learning of Dynamic Bayesian Networks. In GECCO '99 1999.
 
25
S. C. Wang and S. P. Li. Learning Bayesian Networks by Lamarckian Genetic Algorithm and Its Application to Yeast Cell-Cycle Gene Network Reconstruction from Time-Series Microarray Data. 3141/2004:49--62.
 
26
M. L. Wong and K. S. Leung. An efficient data mining method for learning Bayesian networks using an evolutionary algorithm-based hybrid approach. 8:378--404, 2004.

Collaborative Colleagues:
Olivier Barriàre: colleagues
Evelyne Lutton: colleagues
Pierre-Henri Wuillemin: colleagues