| タイトル | Monte-Carlo methods make Dempster-Shafer formalism feasible |
| 本文（外部サイト） | http://hdl.handle.net/2060/19930015951 |
| 著者（英） | Kreinovich, Vladik YA.; Bernat, Andrew; Mariscal, Yvonne; Borrett, Walter; Villa, Elsa |
| 著者所属（英） | NASA Johnson Space Center |
| 発行日 | 1991-01-01 |
| 言語 | eng |
| 内容記述 | One of the main obstacles to the applications of Dempster-Shafer formalism is its computational complexity. If we combine m different pieces of knowledge, then in general case we have to perform up to 2(sup m) computational steps, which for large m is infeasible. For several important cases algorithms with smaller running time were proposed. We prove, however, that if we want to compute the belief bel(Q) in any given query Q, then exponential time is inevitable. It is still inevitable, if we want to compute bel(Q) with given precision epsilon. This restriction corresponds to the natural idea that since initial masses are known only approximately, there is no sense in trying to compute bel(Q) precisely. A further idea is that there is always some doubt in the whole knowledge, so there is always a probability p(sub o) that the expert's knowledge is wrong. In view of that it is sufficient to have an algorithm that gives a correct answer a probability greater than 1-p(sub o). If we use the original Dempster's combination rule, this possibility diminishes the running time, but still leaves the problem infeasible in the general case. We show that for the alternative combination rules proposed by Smets and Yager feasible methods exist. We also show how these methods can be parallelized, and what parallelization model fits this problem best. |
| NASA分類 | NUMERICAL ANALYSIS |
| レポートNO | 93N25140
NASA-CR-192945
NAS 1.26:192945 |
| 権利 | No Copyright |
|
