.png){kind=icon}
返回
Efficient Bayesian network modeling of systems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ress.2012.11.017.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The Bayesian network (BN) is a convenient tool for probabilistic modeling of system performance, particularly when it is of interest to update the reliability of the system or its components in light of observed information. In this paper, BN structures for modeling the performance of systems that are defined in terms of their minimum link or cut sets are investigated. Standard BN structures that define the system node as a child of its constituent components or its minimum link/cut sets lead to converging structures, which are computationally disadvantageous and could severely hamper application of the BN to real systems. A systematic approach to defining an alternative formulation is developed that creates chain-like BN structures that are orders of magnitude more efficient, particularly in terms of computational memory demand. The formulation uses an integer optimization algorithm to identify the most efficient BN structure. Example applications demonstrate the proposed methodology and quantify the gained computational advantage. Published by Elsevier Ltd.
Keyword:
Bayesian network
Integer optimization
Max-flow min-cut theorem
Minimum cut sets
Minimum link sets
Parallel systems
Series systems
Systems
期刊
R
IF:
11
论文数:
9.0K
被引数:
4.2W
机构
引用论文
.png){kind=icon}
Improving the analysis of dependable systems by mapping fault trees into Bayesian networks通过将故障树映射到贝叶斯网络来改善对可靠系统的分析
PREAI
分享收藏分享收藏
查看更多内容