基于仿生猴子搜索元启发式的贝叶斯信念网络结构学习算法

S. Mittal, K. Gopal, S. Maskara
{"title":"基于仿生猴子搜索元启发式的贝叶斯信念网络结构学习算法","authors":"S. Mittal, K. Gopal, S. Maskara","doi":"10.1109/IC3.2014.6897163","DOIUrl":null,"url":null,"abstract":"Bayesian Belief Networks (BBN) combine available statistics and expert knowledge to provide a succinct representation of domain knowledge under uncertainty. Learning BBN structure from data is an NP hard problem due to enormity of search space. In recent past, heuristics based methods have simplified the search space to find optimal BBN structure (based on certain scores) in reasonable time. However, slow convergence and suboptimal solutions are common problems with these methods. In this paper, a novel searching algorithm based on bio-inspired monkey search meta-heuristic has been proposed. The jump, watch-jump and somersault sub processes are designed to give a global optimal solution with fast convergence. The proposed method, Monkey Search Structure Leaner (MS2L), is evaluated against five popular BBN structure learning approaches on model construction time and classification accuracy. The results obtained prove the superiority of our proposed algorithm on all metrics.","PeriodicalId":444918,"journal":{"name":"2014 Seventh International Conference on Contemporary Computing (IC3)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A novel Bayesian Belief Network structure learning algorithm based on bio-inspired monkey search meta heuristic\",\"authors\":\"S. Mittal, K. Gopal, S. Maskara\",\"doi\":\"10.1109/IC3.2014.6897163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Bayesian Belief Networks (BBN) combine available statistics and expert knowledge to provide a succinct representation of domain knowledge under uncertainty. Learning BBN structure from data is an NP hard problem due to enormity of search space. In recent past, heuristics based methods have simplified the search space to find optimal BBN structure (based on certain scores) in reasonable time. However, slow convergence and suboptimal solutions are common problems with these methods. In this paper, a novel searching algorithm based on bio-inspired monkey search meta-heuristic has been proposed. The jump, watch-jump and somersault sub processes are designed to give a global optimal solution with fast convergence. The proposed method, Monkey Search Structure Leaner (MS2L), is evaluated against five popular BBN structure learning approaches on model construction time and classification accuracy. The results obtained prove the superiority of our proposed algorithm on all metrics.\",\"PeriodicalId\":444918,\"journal\":{\"name\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-09-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 Seventh International Conference on Contemporary Computing (IC3)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IC3.2014.6897163\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Seventh International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2014.6897163","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

贝叶斯信念网络(BBN)将可用的统计数据与专家知识相结合,提供了不确定情况下领域知识的简洁表示。由于搜索空间巨大,从数据中学习BBN结构是一个NP困难问题。近年来,基于启发式的方法简化了搜索空间,在合理的时间内找到最优的BBN结构(基于一定的分数)。然而,缓慢的收敛和次优解是这些方法的常见问题。本文提出了一种基于仿生猴子搜索元启发式的搜索算法。设计了跳跃子过程、注视子过程和空翻子过程,给出了全局最优解,收敛速度快。本文提出的Monkey Search Structure Leaner (MS2L)方法在模型构建时间和分类精度方面与五种流行的BBN结构学习方法进行了比较。实验结果证明了该算法在各指标上的优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel Bayesian Belief Network structure learning algorithm based on bio-inspired monkey search meta heuristic
Bayesian Belief Networks (BBN) combine available statistics and expert knowledge to provide a succinct representation of domain knowledge under uncertainty. Learning BBN structure from data is an NP hard problem due to enormity of search space. In recent past, heuristics based methods have simplified the search space to find optimal BBN structure (based on certain scores) in reasonable time. However, slow convergence and suboptimal solutions are common problems with these methods. In this paper, a novel searching algorithm based on bio-inspired monkey search meta-heuristic has been proposed. The jump, watch-jump and somersault sub processes are designed to give a global optimal solution with fast convergence. The proposed method, Monkey Search Structure Leaner (MS2L), is evaluated against five popular BBN structure learning approaches on model construction time and classification accuracy. The results obtained prove the superiority of our proposed algorithm on all metrics.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信