{"title":"基于粒子群优化的贝叶斯网络结构学习方法","authors":"Saoussen Aouay, Salma Jamoussi, Yassine Ben Ayed","doi":"10.1109/ICMSAO.2013.6552569","DOIUrl":null,"url":null,"abstract":"Bayesian Networks (BNs) are good tools for representing knowledge and reasoning under conditions of uncertainty. In general, learning Bayesian Network structure from a data-set is considered a NP-hard problem, due to the search space complexity. A novel structure-learning method, based on PSO (Particle Swarm Optimization) and the K2 algorithm, is presented in this paper. To learn the structure of a bayesian network, PSO here is used for searching in the space of orderings. Then the fitness of each ordering is calculated by running the K2 algorithm and returning the score of the network consistent with it. The experimental results demonstrate that our approach produces better performance compared to others BN structure learning algorithms.","PeriodicalId":339666,"journal":{"name":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Particle swarm optimization based method for Bayesian Network structure learning\",\"authors\":\"Saoussen Aouay, Salma Jamoussi, Yassine Ben Ayed\",\"doi\":\"10.1109/ICMSAO.2013.6552569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bayesian Networks (BNs) are good tools for representing knowledge and reasoning under conditions of uncertainty. In general, learning Bayesian Network structure from a data-set is considered a NP-hard problem, due to the search space complexity. A novel structure-learning method, based on PSO (Particle Swarm Optimization) and the K2 algorithm, is presented in this paper. To learn the structure of a bayesian network, PSO here is used for searching in the space of orderings. Then the fitness of each ordering is calculated by running the K2 algorithm and returning the score of the network consistent with it. The experimental results demonstrate that our approach produces better performance compared to others BN structure learning algorithms.\",\"PeriodicalId\":339666,\"journal\":{\"name\":\"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)\",\"volume\":\"176 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMSAO.2013.6552569\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMSAO.2013.6552569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Particle swarm optimization based method for Bayesian Network structure learning
Bayesian Networks (BNs) are good tools for representing knowledge and reasoning under conditions of uncertainty. In general, learning Bayesian Network structure from a data-set is considered a NP-hard problem, due to the search space complexity. A novel structure-learning method, based on PSO (Particle Swarm Optimization) and the K2 algorithm, is presented in this paper. To learn the structure of a bayesian network, PSO here is used for searching in the space of orderings. Then the fitness of each ordering is calculated by running the K2 algorithm and returning the score of the network consistent with it. The experimental results demonstrate that our approach produces better performance compared to others BN structure learning algorithms.