.png){kind=icon}
返回
Bayesian network structure learning by dynamic programming algorithm based on node block sequence constraints
.png){kind=icon}
OA
AI
DOI：10.1049/cit2.12363.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The use of dynamic programming (DP) algorithms to learn Bayesian network structures is limited by their high space complexity and difficulty in learning the structure of large-scale networks. Therefore, this study proposes a DP algorithm based on node block sequence constraints. The proposed algorithm constrains the traversal process of the parent graph by using the M-sequence matrix to considerably reduce the time consumption and space complexity by pruning the traversal process of the order graph using the node block sequence. Experimental results show that compared with existing DP algorithms, the proposed algorithm can obtain learning results more efficiently with less than 1% loss of accuracy, and can be used for learning larger-scale networks.
Keyword:
Bayesian network
dynamic programming
node block sequence
strongly connected component
structure learning
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.3
论文数:
661
被引数:
2.4K
机构
引用论文
Asymptotics of reaction–diffusion fronts with one static and one diffusing reactant具有一个静态和一个扩散反应物的反应扩散前沿的渐近性OAAI
OAAI分享收藏Learning Bayesian network structures under incremental construction curricula.png)
NEUROCOMPUTING
NEUROCOMPUTINGIF6.5
PREAI
分享收藏
查看更多内容