Name
Title | ||
|---|---|---|
Computing mean and variance under Dempster–Shafer uncertainty: Towards faster algorithms |
Abstract | ||
|---|---|---|
In many real-life situations, we only have partial information about the actual probability distribution. For example, under Dempster–Shafer uncertainty, we only know the masses m1,…,mn assigned to different sets S1,…,Sn, but we do not know the distribution within each set Si. Because of this uncertainty, there are many possible probability distributions consistent with our knowledge; different distributions have, in general, different values of standard statistical characteristics such as mean and variance. It is therefore desirable, given a Dempster–Shafer knowledge base, to compute the ranges [E̲,E¯] and [V̲,V¯] of possible values of mean E and of variance V. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1016/j.ijar.2005.12.001 | International Journal of Approximate Reasoning |
Keywords | Field | DocType |
quadratic optimization,dempster shafer,polynomial time,probability distribution,knowledge base | Discrete mathematics,Algorithm,Regular polygon,Quadratic function,Convex function,Probability distribution,Quadratic programming,Time complexity,Dempster–Shafer theory,Mathematics | Journal |
Volume | Issue | ISSN |
42 | 3 | 0888-613X |
Citations | PageRank | References |
8 | 0.72 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vladik Kreinovich | 1 | 1091 | 281.07 |
| Gang Xiang | 2 | 77 | 11.18 |
| Scott Ferson | 3 | 305 | 37.30 |