Dan Liu, Jie Wu, Lin Liang, Xiaowan Li, Chunguang Luo, Guanghua Xu
{"title":"An incremental Bayesian network structure learning algorithm based on local updating strategy","authors":"Dan Liu, Jie Wu, Lin Liang, Xiaowan Li, Chunguang Luo, Guanghua Xu","doi":"10.1109/IAEAC47372.2019.8997724","DOIUrl":null,"url":null,"abstract":"Bayesian network is wildly applied in AI field, but current structure learning algorithms consume a significant amount of time when faced with big data. We propose an incremental algorithm based on local updating strategy. First, we adopted a balanced decomposition for the structure, found the sub-network needed to be updated, and updated it to obtain the new network. Then we did simulation experiments to verify the validity of our method. Finally, we compared the efficiency and accuracy of our method with that of other mainstream algorithms. The result shows that our method runs in a low constant time, and its average accuracy of structure learning reaches 98%.","PeriodicalId":164163,"journal":{"name":"2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","volume":"94 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE 4th Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAEAC47372.2019.8997724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Bayesian network is wildly applied in AI field, but current structure learning algorithms consume a significant amount of time when faced with big data. We propose an incremental algorithm based on local updating strategy. First, we adopted a balanced decomposition for the structure, found the sub-network needed to be updated, and updated it to obtain the new network. Then we did simulation experiments to verify the validity of our method. Finally, we compared the efficiency and accuracy of our method with that of other mainstream algorithms. The result shows that our method runs in a low constant time, and its average accuracy of structure learning reaches 98%.