Xuchu Dong, Haihong Yu, D. Ouyang, Dianbo Cai, Yuxin Ye, Yonggang Zhang
{"title":"Cooperative coevolutionary genetic algorithms to find optimal elimination orderings for Bayesian networks","authors":"Xuchu Dong, Haihong Yu, D. Ouyang, Dianbo Cai, Yuxin Ye, Yonggang Zhang","doi":"10.1109/BICTA.2010.5645605","DOIUrl":null,"url":null,"abstract":"According to the characteristics of the optimal elimination ordering problem in Bayesian networks, a heuristic-based genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are proposed. Based on these works, six cooperative coevolutionary genetic algorithms are constructed. Numerical experiments show that these algorithms are more robust than other existing swarm intelligence methods when solving the elimination ordering problem.","PeriodicalId":302619,"journal":{"name":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Fifth International Conference on Bio-Inspired Computing: Theories and Applications (BIC-TA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BICTA.2010.5645605","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
According to the characteristics of the optimal elimination ordering problem in Bayesian networks, a heuristic-based genetic algorithm, a cooperative coevolutionary genetic framework and five grouping schemes are proposed. Based on these works, six cooperative coevolutionary genetic algorithms are constructed. Numerical experiments show that these algorithms are more robust than other existing swarm intelligence methods when solving the elimination ordering problem.