×

Combining dependent evidential bodies that share common knowledge. (English) Zbl 1433.60082

Summary: We establish a formula for combining dependent evidential bodies that are conditionally independent given their shared knowledge. Markov examples are provided to illustrate various aspects of our combination formula, including its practicality. We also show that the Dempster-Shafer formula and the conjunctive rule of the Transferable Belief Model can be recovered as special cases of our combination formula.

MSC:

60J20 Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)
68T30 Knowledge representation
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Besnard, P.; Jaouen, P.; Perin, P. J., Extending the transferable belief model for inconsistency handling, (Proceedings of the International Conference on Information Processing and Management of Uncertainty in Knowledge Based Systems. Proceedings of the International Conference on Information Processing and Management of Uncertainty in Knowledge Based Systems, IPMU (1996)), 143-148
[2] Billingsley, P., Probability and Measure (1995), Wiley Interscience: Wiley Interscience New York · Zbl 0822.60002
[3] Brin, S.; Page, L., The anatomy of a large-scale hypertextual Web search engine, Comput. Netw. ISDN Syst., 30, 1, 107-117 (1998)
[4] Cattaneo, M. E.G. V., Belief functions combination without the assumption of independence of the information sources, Int. J. Approx. Reason., 52, 3, 299-315 (2011) · Zbl 1217.68210
[5] Cattaneo, Marco E. G.V., Combining belief functions issued from dependent sources, (Proceedings of the International Symposium on Imprecise Probabilities and Their Applications. Proceedings of the International Symposium on Imprecise Probabilities and Their Applications, ISIPTA, vol. 3 (2003)), 133-147
[6] Chung, K. L., A Course in Probability Theory (2001), Academic Press: Academic Press London
[7] Dempster, A. P., Upper and lower probabilities induced by a multivalued mapping, Ann. Math. Stat., 38, 2, 325-339 (1967) · Zbl 0168.17501
[8] Denœux, T., Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence, Artif. Intell., 172, 2, 234-264 (2008) · Zbl 1182.68298
[9] Destercke, S.; Dubois, D., Idempotent conjunctive combination of belief functions: extending the minimum rule of possibility theory, Inf. Sci., 181, 18, 3925-3945 (2011) · Zbl 1242.68324
[10] Dubois, D.; Prade, H., On the unicity of Dempster rule of combination, Int. J. Intell. Syst., 1, 2, 133-142 (1986) · Zbl 0641.68159
[11] Dubois, D.; Prade, H., A set-theoretic view of belief functions, (Classic Works of the Dempster-Shafer Theory of Belief Functions (2008)), 375-410
[12] Dubois, D.; Yager, R. R., Fuzzy set connectives as combinations of belief structures, Inf. Sci., 66, 3, 245-276 (1992) · Zbl 0765.60004
[13] Elouedi, Z.; Mellouli, K., Pooling dependent expert opinions using the theory of evidence, (Traitement d’information et gestion d’incertitudes dans les systèmes à base de connaissances. Conférence internationale (1998)), 32-39
[14] Feller, W., An Introduction to Probability Theory and Its Applications, vol. 1 (1968), Wiley: Wiley New York · Zbl 0155.23101
[15] Feller, W., An Introduction to Probability Theory and Its Applications, vol. 2 (1971), Wiley: Wiley New York · Zbl 0219.60003
[16] Fine, S.; Singer, Y.; Tishby, N., The hierarchical hidden Markov model: analysis and applications, Mach. Learn., 32, 1, 41-62 (1998) · Zbl 0901.68178
[17] Gross, D.; Harris, C. M., Fundamentals of Queuing Theory (1998), Wiley: Wiley New York
[18] Halpern, J. Y.; Fagin, R., Two views of belief: belief as generalized probability and belief as evidence, Artif. Intell., 54, 3, 275-317 (1992) · Zbl 0762.68055
[19] Harvey, A. C., Forecasting, Structural Time Series Models and the Kalman Filter (1990), Cambridge University Press · Zbl 0725.62083
[20] Hastings, W. K., Monte Carlo sampling methods using Markov chains and their applications, Biometrika, 57, 1, 97-109 (1970) · Zbl 0219.65008
[21] Ling, X.; Rudd, W. G., Combining opinions from several experts, Appl. Artif. Intell., 3, 4, 439-452 (1989)
[22] Liu, W.; Hong, J., Reinvestigating Dempster’s idea on evidence combination, Knowl. Inf. Syst., 2, 2, 223-241 (2000) · Zbl 1002.68606
[23] Lux, T., The Markov-switching multifractal model of asset returns: GMM estimation and linear forecasting of volatility, J. Bus. Econ. Stat., 26, 2, 194-210 (2008)
[24] Meinhold, R. J.; Singpurwalla, N. D., Understanding the Kalman filter, Am. Stat., 37, 2, 123-127 (1983)
[25] Metropolis, N.; Rosenbluth, A. W.; Rosenbluth, M. N.; Teller, A. H.; Teller, E., Equation of state calculations by fast computing machines, J. Chem. Phys., 21, 6, 1087-1092 (1953) · Zbl 1431.65006
[26] Pearl, J., Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference (1988), Morgan Kaufmann
[27] Pollard, D., A User’s Guide to Measure Theoretic Probability (2002), Cambridge University Press: Cambridge University Press New York · Zbl 0992.60001
[28] Puterman, M. L., Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley Series in Probability and Statistics, vol. 414 (2009), Wiley
[29] Rabiner, L., A tutorial on hidden Markov models and selected applications in speech recognition, Proc. IEEE, 77, 2, 257-286 (1989)
[30] Ross, S. M., Stochastic Processes (1996), Wiley: Wiley New York · Zbl 0888.60002
[31] Ross, S. M., Introduction to Probability Models (2006), Academic Press: Academic Press New York · Zbl 1118.60002
[32] Ruspini, E. H., Logical foundations of evidential reasoning (1986), SRI International: SRI International Menlo Park, CA, Technical Note 408
[33] Ruspini, E. H., Epistemic logics, probability, and the calculus of evidence, (Classic Works of the Dempster-Shafer Theory of Belief Functions (2008), Springer), 435-448
[34] Rust, J., Structural estimation of Markov decision processes, Handb. Econom., 4, 4 (1994)
[35] Shafer, G., A Mathematical Theory of Evidence (1976), Princeton University Press: Princeton University Press Princeton, NJ · Zbl 0359.62002
[36] Smets, P., Combining non-distinct evidences, (International Conference of the North American Fuzzy Information Processing Society. International Conference of the North American Fuzzy Information Processing Society, NAFIPS 1986 (1986)), 544-549
[37] Smets, P., Belief functions: the disjunctive rule of combination and the generalized Bayesian theorem, Int. J. Approx. Reason., 9, 1, 1-35 (1993) · Zbl 0796.68177
[38] Smets, P., The Transferable Belief Model for quantified belief representation, (Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1 (1998)), 267-301 · Zbl 0939.68112
[39] Smets, P.; Kennes, R., The transferable belief model, Artif. Intell., 66, 2, 191-234 (1994) · Zbl 0807.68087
[40] Sutton, R. S.; Barto, A. G., Reinforcement Learning (1998), MIT Press: MIT Press Cambridge, MA
[41] Thrun, S.; Burgard, W.; Fox, D., Probabilistic Robotics (2005), MIT Press: MIT Press Cambridge, MA · Zbl 1081.68703
[42] Viterbi, A. J., Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, IEEE Trans. Inf. Theory, 13, 2, 260-269 (1967) · Zbl 0148.40501
[43] Voorbraak, F., On the justification of Dempster’s rule of combination, Artif. Intell., 48, 2, 171-197 (1991) · Zbl 1117.68496
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.