• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

Bayesian network structure learning by opposition-based learning.

作者信息

Sun Baodan, Zhang Xinyi, Jiang Junhui, Gong Jianguang, Lin Dan

机构信息

Harbin Engineering University, College of Computer Science and Technology, Harbin, 150001, China.

National Key Laboratory of Smart Farm Technologies and Systems, Harbin, 150001, China.

出版信息

Sci Rep. 2025 May 27;15(1):18447. doi: 10.1038/s41598-025-03267-2.

DOI:10.1038/s41598-025-03267-2
PMID:40419650
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC12106786/
Abstract

As a classical basic model for causal inference, Bayesian networks are of vital importance both in artificial intelligence with uncertainty and interpretability. The significant status of Bayesian networks in these research orientations depends on its topological structure, namely directed acyclic graphs. Bayesian network structure learning is a well-known NP-hard problem, and its computation accuracy is still worth being further studied. In this paper, we propose a new Bayesian network structure learning algorithm, OP-PSO-DE, which combines Particle Swarm Optimization(PSO) and Differential Evolution to search for the optimal structure. Since the computation complexity of BN structure learning increases exponentially with the number of nodes, the proposed algorithm incorporates opposition-based learning to narrow the search space of heuristic algorithms, which can effectively accelerate the searching process. Experimental results show that the proposed algorithm achieves better performances than other state-of-the-art structure learning algorithms when the sample size is 500. The source code of the paper can be found at this link: https://github.com/sunbaodan-hrbeu/paper_code .

摘要
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/25f310bdb102/41598_2025_3267_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/1216676fab06/41598_2025_3267_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/a17d75fed91f/41598_2025_3267_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/a402656c8cd8/41598_2025_3267_Figb_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/c6ceae5b6285/41598_2025_3267_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/fb627cc99c34/41598_2025_3267_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/25f310bdb102/41598_2025_3267_Fig4_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/1216676fab06/41598_2025_3267_Fig1_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/a17d75fed91f/41598_2025_3267_Figa_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/a402656c8cd8/41598_2025_3267_Figb_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/c6ceae5b6285/41598_2025_3267_Fig2_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/fb627cc99c34/41598_2025_3267_Fig3_HTML.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2128/12106786/25f310bdb102/41598_2025_3267_Fig4_HTML.jpg

相似文献

1
Bayesian network structure learning by opposition-based learning.
Sci Rep. 2025 May 27;15(1):18447. doi: 10.1038/s41598-025-03267-2.
2
Bayesian network structure learning based on the chaotic particle swarm optimization algorithm.基于混沌粒子群优化算法的贝叶斯网络结构学习
Genet Mol Res. 2013 Oct 10;12(4):4468-79. doi: 10.4238/2013.October.10.12.
3
Dynamic Bayesian network structure learning based on an improved bacterial foraging optimization algorithm.基于改进细菌觅食优化算法的动态贝叶斯网络结构学习。
Sci Rep. 2024 Apr 9;14(1):8266. doi: 10.1038/s41598-024-58806-0.
4
Optimizing Regularized Cholesky Score for Order-Based Learning of Bayesian Networks.优化用于贝叶斯网络基于顺序学习的正则化乔列斯基评分
IEEE Trans Pattern Anal Mach Intell. 2021 Oct;43(10):3555-3572. doi: 10.1109/TPAMI.2020.2990820. Epub 2021 Sep 2.
5
An improved Bayesian network method for reconstructing gene regulatory network based on candidate auto selection.基于候选自动选择的基因调控网络重建的改进贝叶斯网络方法。
BMC Genomics. 2017 Nov 17;18(Suppl 9):844. doi: 10.1186/s12864-017-4228-y.
6
SAGA: a hybrid search algorithm for Bayesian Network structure learning of transcriptional regulatory networks.SAGA:一种用于转录调控网络贝叶斯网络结构学习的混合搜索算法。
J Biomed Inform. 2015 Feb;53:27-35. doi: 10.1016/j.jbi.2014.08.010. Epub 2014 Aug 30.
7
A hybrid particle swarm optimization algorithm for solving engineering problem.一种用于解决工程问题的混合粒子群优化算法。
Sci Rep. 2024 Apr 10;14(1):8357. doi: 10.1038/s41598-024-59034-2.
8
A Hybrid Structure Learning Algorithm for Bayesian Network Using Experts' Knowledge.一种利用专家知识的贝叶斯网络混合结构学习算法。
Entropy (Basel). 2018 Aug 20;20(8):620. doi: 10.3390/e20080620.
9
Multi-strategy improved salp swarm algorithm and its application in reliability optimization.多策略改进沙鱼群算法及其在可靠性优化中的应用。
Math Biosci Eng. 2022 Mar 24;19(5):5269-5292. doi: 10.3934/mbe.2022247.
10
Multi-Swarm Algorithm for Extreme Learning Machine Optimization.多群算法在极限学习机优化中的应用。
Sensors (Basel). 2022 May 31;22(11):4204. doi: 10.3390/s22114204.

本文引用的文献

1
Optimizing Regularized Cholesky Score for Order-Based Learning of Bayesian Networks.优化用于贝叶斯网络基于顺序学习的正则化乔列斯基评分
IEEE Trans Pattern Anal Mach Intell. 2021 Oct;43(10):3555-3572. doi: 10.1109/TPAMI.2020.2990820. Epub 2021 Sep 2.