期刊文献+

Self-Organizing Genetic Algorithm Based Method for Constructing Bayesian Networks from Databases

Self-Organizing Genetic Algorithm Based Method for Constructing Bayesian Networks from Databases
下载PDF
导出
摘要 The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learning of BNs structures by general genetic algorithms is liable to converge to local extremum. To resolve efficiently this problem, a self-organizing genetic algorithm (SGA) based method for constructing BNs from databases is presented. This method makes use of a self-organizing mechanism to develop a genetic algorithm that extended the crossover operator from one to two, providing mutual competition between them, even adjusting the numbers of parents in recombination (crossover/recomposition) schemes. With the K2 algorithm, this method also optimizes the genetic operators, and utilizes adequately the domain knowledge. As a result, with this method it is able to find a global optimum of the topology of BNs, avoiding premature convergence to local extremum. The experimental results proved to be and the convergence of the SGA was discussed. The typical characteristic of the topology of Bayesian networks (BNs) is the interdependence among different nodes (variables), which makes it impossible to optimize one variable independently of others, and the learning of BNs structures by general genetic algorithms is liable to converge to local extremum. To resolve efficiently this problem, a self-organizing genetic algorithm (SGA) based method for constructing BNs from databases is presented. This method makes use of a self-organizing mechanism to develop a genetic algorithm that extended the crossover operator from one to two, providing mutual competition between them, even adjusting the numbers of parents in recombination (crossover/recomposition) schemes. With the K2 algorithm, this method also optimizes the genetic operators, and utilizes adequately the domain knowledge. As a result, with this method it is able to find a global optimum of the topology of BNs, avoiding premature convergence to local extremum. The experimental results proved to be and the convergence of the SGA was discussed.
出处 《Journal of Beijing Institute of Technology》 EI CAS 2003年第1期23-27,共5页 北京理工大学学报(英文版)
基金 SponsoredbytheMinisterialLevelAdvancedResearchFoundation(10 40 5 0 3 3 )
关键词 Bayesian networks structure learning from databases self-organizing genetic algorithm Bayesian networks structure learning from databases self-organizing genetic algorithm
  • 相关文献

参考文献8

  • 1David Heckerman,Dan Geiger,David M. Chickering.Learning Bayesian Networks: The Combination of Knowledge and Statistical Data[J].Machine Learning.1995(3)
  • 2Gregory F. Cooper,Edward Herskovits.A Bayesian Method for the Induction of Probabilistic Networks from Data[J].Machine Learning.1992(4)
  • 3Gelsema E S.Abductive reasoning in Bayesian belief networks using a genetic algorithm[].Pattern Recognition.1995
  • 4Minkin Y I,Petrov A I.A self-organizing genetic algorithm[].Journal of Computer and Systems Sciences Informational.2001
  • 5Eiben A E,Cees H M,Van K.Diagonal crossover in genetic algorithms for numerical optimization[].Journal on Control and Cybernetics.1997
  • 6Mehdi M,Owrang O.Using domain knowledge to optimize the knowledge discovery process in databases[].International Journal of Intelligents Systems.2000
  • 7Sewell W,Shah V.Social class, parental encouragement, and educational aspirations[].The American Journal of Sociology.1968
  • 8Gelsema E S.Diagnostic reasoning based on a genetic algorithm operating in a Bayesian network[].Pattern Recognition.1996

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部