.png){kind=icon}
返回
Event-Tree Analysis with Imprecise Probabilities
.png){kind=icon}
PRE
AI
DOI：10.1111/j.1539-6924.2011.01721.x.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Novel methods are proposed for dealing with event-tree analysis under imprecise probabilities, where one could measure chance or uncertainty without sharp numerical probabilities and express available evidence as upper and lower previsions (or expectations) of gambles (or bounded real functions). Sets of upper and lower previsions generate a convex set of probability distributions (or measures). Any probability distribution in this convex set should be considered in the event-tree analysis. This article focuses on the calculation of upper and lower bounds of the prevision (or the probability) of some outcome at the bottom of the event-tree. Three cases of given information/judgments on probabilities of outcomes are considered: (1) probabilities conditional to the occurrence of the event at the upper level; (2) total probabilities of occurrences, that is, not conditional to other events; (3) the combination of the previous two cases. Corresponding algorithms with imprecise probabilities under the three cases are explained and illustrated by simple examples.
Keyword:
Event-tree analysis
imprecise probabilities
risk analysis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.3
论文数:
5.6K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
分享收藏Putting gene drives into context: Risks, depth of intervention, and regulatory challenges将基因驱动系统置于背景中：风险、干预深度和监管挑战
PREAI
分享收藏Guidelines for tunnelling risk management: International Tunnelling Association, Working Group No.2
PREAI
分享收藏
查看更多内容