M. Perkusich, A. Perkusich, Hyggo Oliveira de Almeida
{"title":"利用调查和加权函数生成贝叶斯网络节点概率表","authors":"M. Perkusich, A. Perkusich, Hyggo Oliveira de Almeida","doi":"10.1109/BRICS-CCI-CBIC.2013.39","DOIUrl":null,"url":null,"abstract":"Recently, Bayesian networks became a popular technique to represent knowledge about uncertain domains and have been successfully used for applications in various areas. Even though there are several cases of success and Bayesian networks have been proved to be capable of representing uncertainty in many different domains, there are still two significant barriers to build large-scale Bayesian networks: building the Directed Acyclic Graph (DAG) and the Node Probability Tables (NPTs). In this paper, we focus on the second barrier and present a method that generates NPTs through weighted expressions generated using data collected from domain experts through a survey. Our method is limited to Bayesian networks composed only of ranked nodes. It consists of five steps: (i) define network's DAG, (ii) run the survey, (iii) order the NPTs' relationships given their relative magnitudes, (iv) generate weighted functions and (v) generate NPTs. The advantage of our method, comparing with existing ones that use weighted expressions to generate NPTs, is the ability to quickly collect data from domain experts located around the world. We describe one case in which the method was used for validation purposes and showed that this method requires less time from each domain expert than other existing methods.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Using Survey and Weighted Functions to Generate Node Probability Tables for Bayesian Networks\",\"authors\":\"M. Perkusich, A. Perkusich, Hyggo Oliveira de Almeida\",\"doi\":\"10.1109/BRICS-CCI-CBIC.2013.39\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, Bayesian networks became a popular technique to represent knowledge about uncertain domains and have been successfully used for applications in various areas. Even though there are several cases of success and Bayesian networks have been proved to be capable of representing uncertainty in many different domains, there are still two significant barriers to build large-scale Bayesian networks: building the Directed Acyclic Graph (DAG) and the Node Probability Tables (NPTs). In this paper, we focus on the second barrier and present a method that generates NPTs through weighted expressions generated using data collected from domain experts through a survey. Our method is limited to Bayesian networks composed only of ranked nodes. It consists of five steps: (i) define network's DAG, (ii) run the survey, (iii) order the NPTs' relationships given their relative magnitudes, (iv) generate weighted functions and (v) generate NPTs. The advantage of our method, comparing with existing ones that use weighted expressions to generate NPTs, is the ability to quickly collect data from domain experts located around the world. We describe one case in which the method was used for validation purposes and showed that this method requires less time from each domain expert than other existing methods.\",\"PeriodicalId\":306195,\"journal\":{\"name\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.39\",\"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 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.39","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Using Survey and Weighted Functions to Generate Node Probability Tables for Bayesian Networks
Recently, Bayesian networks became a popular technique to represent knowledge about uncertain domains and have been successfully used for applications in various areas. Even though there are several cases of success and Bayesian networks have been proved to be capable of representing uncertainty in many different domains, there are still two significant barriers to build large-scale Bayesian networks: building the Directed Acyclic Graph (DAG) and the Node Probability Tables (NPTs). In this paper, we focus on the second barrier and present a method that generates NPTs through weighted expressions generated using data collected from domain experts through a survey. Our method is limited to Bayesian networks composed only of ranked nodes. It consists of five steps: (i) define network's DAG, (ii) run the survey, (iii) order the NPTs' relationships given their relative magnitudes, (iv) generate weighted functions and (v) generate NPTs. The advantage of our method, comparing with existing ones that use weighted expressions to generate NPTs, is the ability to quickly collect data from domain experts located around the world. We describe one case in which the method was used for validation purposes and showed that this method requires less time from each domain expert than other existing methods.