×

zbMATH — the first resource for mathematics

Approximations of believeability functions under incomplete identification of sets of compatible states. (English) Zbl 0869.62007
Summary: The believeability function has been introduced and investigated in the Dempster-Shafer theory as a numerical characteristic of uncertainty ascribing to each set of possible answers to a question, or set of possible states of an investigated system, under another interpretation, the probability with which the obtained random empirical data (observations) are such that the true answer, or the actual state of the system, can be proved to belong to the set in question. In other words, this value is defined by the probability that the set of all answers or states compatible with the at random obtained data is a subset of the set the believeability of which is to be defined.
We shall investigate the case when the set of compatible states cannot be completely defined so that we have at hand just a class of sets of answers or states containing the set of compatible states. Using this class of sets, we shall define and compute an approximation of the desired value of the believeability function, which can be useful in some decision-making problems when not the value of this function itself, but rather the fact whether this value exceeds some threshold value or not is important.

MSC:
62A01 Foundations and philosophical topics in statistics
60A99 Foundations of probability theory
PDF BibTeX XML Cite
Full Text: Link EuDML
References:
[1] A. P. Dempster: Upper and lower probabilities induced by a multivalued mapping. Ann. Math. Statist. 38 (1967), 325-339. · Zbl 0168.17501 · doi:10.1214/aoms/1177698950
[2] P. Hájek T. Havránek, R. Jiroušek: Uncertain Information Processing in Expert Systems. CRC Press, California 1991.
[3] I. Kramosil: An intensional interpretation and generalization of Dempster-Shafer approach to uncertainty processing. Logica 93 - Proceedings of the 7th International Symposium (P. Kolaf and V. Svoboda, Filosofia - Publishing House of the Institute of Philosophy of the Academy of Sciences of the Czech Republic, Prague 1994, pp. 105-122.
[4] E. L. Lehmann: Testing Statistical Hypotheses. Wiley, New York 1947. · Zbl 0089.14102
[5] J. Pearl: Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann Publishers, Inc., San Matteo, California 1988. · Zbl 0746.68089
[6] G. Shafer: A Mathematical Theory of Evidence. Princeton Univ. Press, Princeton, New Jersey 1976. · Zbl 0359.62002
[7] P. Smets: Belief functions. Nonstandard Logics for Automated Reasoning (P. Smets, A. Mamdani, D. Dubois and H. Prade, Academic Press, London 1988, pp. 253-286.
[8] P. Smets: The nature of the unnormalized beliefs encountered in the transferable belief model. Uncertainty in AI92 (D. Dubois, M. P. Wellman, B. d’Ambrosio and P. Smets, Morgan Kaufmann, San Matteo, California 1992, pp. 292-297.
[9] P. Smets: Belief functions: the disjunctive rule of combination and the generalized bayesian theorem. Internat. J. Approx. Reason. 7 (1993), 1-35. · Zbl 0796.68177 · doi:10.1016/0888-613X(93)90005-X
[10] A. Wald: Sequential Analysis. Wiley, New York 1947. · Zbl 0041.26303
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.