Local computations in Dempster-Shafer theory of evidence

When applying any technique of multidimensional models to problems of practice, one always has to cope with two problems: the necessity to represent the models with a ''reasonable'' number of parameters and to have sufficiently efficient computational procedures at one's disposal. When considering graphical Markov models in probability theory, both of these conditions are fulfilled; various computational procedures for decomposable models are based on the ideas of local computations, whose theoretical foundations were laid by Lauritzen and Spiegelhalter. The presented contribution studies a possibility of transferring these ideas from probability theory into Dempster-Shafer theory of evidence. The paper recalls decomposable models, discusses connection of the model structure with the corresponding system of conditional independence relations, and shows that under special additional conditions, one can locally compute specific basic assignments which can be considered to be conditional.

[1]  Augustine Kong,et al.  Uncertain evidence and artificial analysis , 1990 .

[2]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[3]  Prakash P. Shenoy,et al.  Axioms for probability and belief-function proagation , 1990, UAI.

[4]  T. Fine,et al.  Towards a Frequentist Theory of Upper and Lower Probability , 1982 .

[5]  Inés Couso,et al.  Examples of Independence for Imprecise Probabilities , 1999, ISIPTA.

[6]  Leo Egghe,et al.  Uncertainty and information: Foundations of generalized information theory , 2007, J. Assoc. Inf. Sci. Technol..

[7]  Compositional Models of Belief Functions , 2007 .

[8]  Arthur P. Dempster,et al.  Upper and Lower Probabilities Induced by a Multivalued Mapping , 1967, Classic Works of the Dempster-Shafer Theory of Belief Functions.

[9]  D. Edwards,et al.  A fast procedure for model search in multidimensional contingency tables , 1985 .

[10]  Bernadette Bouchon-Meunier,et al.  Advances in intelligent computing--IPMU '94 : 5th International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, Paris, France, July 4-8, 1994 : selected papers , 1995 .

[11]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[12]  Albert Perez Ε-admissible Simplifications of the Dependence Structure of a Set of Random Variables , 1977, Kybernetika.

[13]  Radim Jirousek,et al.  Compositional models and conditional independence in evidence theory , 2011, Int. J. Approx. Reason..

[14]  R. Jirousek Factorization and Decomposable Models in Dempster-Shafer Theory of Evidence , 2010 .

[15]  Radim Jirousek An Attempt to Define Graphical Models in Dempster-Shafer Theory of Evidence , 2010, SMPS.

[16]  Catriel Beeri,et al.  On the Desirability of Acyclic Database Schemes , 1983, JACM.

[17]  Finn V. Jensen,et al.  Bayesian Networks and Decision Graphs , 2001, Statistics for Engineering and Information Science.

[18]  Khaled Mellouli,et al.  Belief function independence: II. The conditional case , 2002, Int. J. Approx. Reason..

[19]  Prakash P. Shenoy,et al.  Binary join trees for computing marginals in the Shenoy-Shafer architecture , 1997, Int. J. Approx. Reason..

[20]  Steffen L. Lauritzen,et al.  Graphical models in R , 1996 .

[21]  Serafín Moral,et al.  Heuristic Algorithms for the Triangulation of Graphs , 1994, IPMU.

[22]  Milan Studený,et al.  On Stochastic Conditional Independence: the Problems of Characterization and Description , 2002, Annals of Mathematics and Artificial Intelligence.

[23]  T. Speed,et al.  Markov Fields and Log-Linear Interaction Models for Contingency Tables , 1980 .

[24]  Radim Jirousek,et al.  Composition of Probability Measures on Finite Spaces , 1997, UAI.

[25]  Pau Klein,et al.  San Francisco, California , 2007 .

[26]  J. Vejnarová Conditional Independence in Evidence Theory , 2008 .

[27]  Prakash P. Shenoy,et al.  Conditional independence in valuation-based systems , 1994, Int. J. Approx. Reason..

[28]  Milan Studený Formal Properties of Conditional Independence in Different Calculi of AI , 1993, ECSQARU.

[29]  Prakash P. Shenoy,et al.  Compositional models in valuation-based systems , 2012, International Journal of Approximate Reasoning.

[30]  Khaled Mellouli,et al.  Belief function independence: I. The marginal case , 2002, Int. J. Approx. Reason..