Using Survey and Weighted Functions to Generate Node Probability Tables for Bayesian Networks

M. Perkusich, A. Perkusich, Hyggo Oliveira de Almeida
{"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":null,"pages":null},"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}
引用次数: 9

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.
利用调查和加权函数生成贝叶斯网络节点概率表
近年来,贝叶斯网络已成为一种表示不确定领域知识的流行技术,并已成功地应用于各个领域。尽管有几个成功的案例,并且贝叶斯网络已被证明能够表示许多不同领域的不确定性,但构建大规模贝叶斯网络仍然存在两个重大障碍:构建有向无环图(DAG)和节点概率表(NPTs)。在本文中,我们将重点放在第二个障碍上,并提出了一种通过调查从领域专家收集的数据生成加权表达式来生成npt的方法。我们的方法仅限于仅由排序节点组成的贝叶斯网络。它由五个步骤组成:(i)定义网络的DAG, (ii)运行调查,(iii)根据其相对大小对npt的关系进行排序,(iv)生成加权函数,(v)生成npt。与使用加权表达式生成npt的现有方法相比,我们的方法的优势在于能够快速收集来自世界各地领域专家的数据。我们描述了一个将该方法用于验证目的的案例,并表明该方法比其他现有方法需要每个领域专家更少的时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信