Structure learning of Bayesian networks by genetic algorithms: A performance analysis of control parameters

被引:253
作者
Larranaga, P
Poza, M
Yurramendi, Y
Murga, RH
Kuijpers, CMH
机构
[1] Department of Computer Science, and Artificial Intelligence, University of the Basque Country, E-20QSO San Sebastian
关键词
Bayesian network; genetic algorithm; structure learning; combinatorial optimization; performance analysis;
D O I
10.1109/34.537345
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a new approach to structure learning in the field of Bayesian networks: We tackle the problem of the search for the best Bayesian network structure, given a database of cases, using the genetic algorithm philosophy for searching among alternative structures. We start by assuming an ordering between the nodes of the network structures. This assumption is necessary to guarantee that the networks that are created by the genetic algorithms are legal Bayesian network structures. Next, we release the ordering assumption by using a ''repair operator'' which converts illegal structures into legal ones. We present empirical results and analyze them statistically. The best results are obtained with an elitist genetic algorithm that contains a local optimizer.
引用
收藏
页码:912 / 926
页数:15
相关论文
共 49 条
[1]  
ACID S, 1991, LECT NOTES COMPUTER, V548
[2]  
ALIFERIS CF, 1994, UNCERTAINTY ARTIFICI
[3]  
[Anonymous], 1994, P 10THCONFERENCE UNC
[4]  
[Anonymous], 1995, PREPROCEEDINGS 5 INT
[5]  
[Anonymous], 1991, Handbook of genetic algorithms
[6]  
Beinlich I., 1989, 2ND P EUR C ART INT, P247
[7]  
Bouckaert R. R., 1992, P 8 C UNC ART INT, P9
[8]  
Bouckaert RR, 1993, Lecture Notes in Computer Science, V747, P41
[9]  
BREMERMANN HJ, 1965, BIOPHYSICS CYBERNETI, P157
[10]   USING RELIABILITY-ANALYSIS TO ESTIMATE THE NUMBER OF GENERATIONS TO CONVERGENCE IN GENETIC ALGORITHMS [J].
CHAKRABORTY, UK ;
DASTIDAR, DG .
INFORMATION PROCESSING LETTERS, 1993, 46 (04) :199-209