Abstract
In this paper, we study different concepts of conditional belief functions independence in the context of the transferable belief model. We especially clarify the relationships between the concepts of conditional non-interactivity, irrelevance and doxastic independence. Conditional non-interactivity is defined by the ’mathematical’ property useful for computation considerations and corresponds to decomposionality of the belief functions. Conditional irrelevance is defined by a ’common sense’ property based on conditioning. Conditional doxastic independence is defined by a particular form of irrelevance, the one preserved under Dempster’s rule of combination.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
G.A.R. Almond (1995), Graphical Belief Modeling, Capman and & Hall.
B. Ben Yaghlane, Ph. Smets and K. Mellouli (2000), Belief Function Independence: I. The Marginal Case, Technical Report TR/IRIDIA/2000-13, Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle, Université Libre de Bruxelles (to be published at Int. J. of Approx. Reasoning).
B. Ben Yaghlane, Ph. Smets and K. Mellouli (2001), Belief Function Independence: II. The Conditional Case, Technical Report TR/IRIDIA/2001-8, Institut de Recherches Interdisciplinaires et de Développements en Intelligence Artificielle, Université Libre de Bruxelles.
F.G. Cozman (1999), Irrelevance and Independence Axioms in Quasi-Bayesian Theory, ECSQARU’99, London, Lecture Notes in AI 1638, A. Hunter and S. Parsons (Eds), Springer-Verlag, pp. 128–136.
A.P. Dawid (1979), Conditional Independence in Statistical Theory, Journal of the Royal Statistical Society, Series B, Vol. 41, pp. 1–31.
A. P. Dawid (2000), Separoids: A general Framework for Conditional Independence and Irrelevance, Technical Report 212, University College London.
A.P. Dawid and M. Studeny (1999), Conditional Products: An Alternative Approach to Conditional Independence, In Artificial Intelligence and Statistics 99, (Eds. D. Heckerman and J. Whittaker), Morgan Kaufmann Publishers, San Francisco, California, pp. 32–40.
L.M. de Campos, Huete J.F. and S. Moral (1995), Possibilistic Independence, Third European Congress on Intelligent Techniques and Soft Computing EUFIT’95, Germany, Vol. 1, pp. 69–73.
R. Fagin (1977), Multivalued Dependencies and a New Form for Relational Databases, ACM Transactions on Database Systems, Vol. 2(3), pp. 262–278.
D. Hunter (1991), Graphoids and Natural Conditional Functions, Int. Journal of Approximate Reasoning, Vol. 5, pp. 489–504.
C.T.A. Kong (1988), A Belief Function Generalization of Gibbs Ensemble, Joint Tech. report S-122 Harvard University and N239 University of Chicago, Departments of Statistics.
J. Kohlas and P.A. Monney (1995), A Mathematical Theory of Hints. An Approach to Dempster-Shafer Theory of Evidence, Lecture Notes in Economics and Mathematical Systems No. 425, Springer-Verlag.
J. Pearl (1988), Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Morgan Kaufmman, Los Altos, CA.
J. Pearl and A. Paz (1987), Graphoids: A Graph-based Logic for Reasoning about Relevance Relations, In Advances in Artificial Intelligence (Eds. D. Hogg and L. Steels), North-Holland, Amsterdam, pp. 357–363.
G. Shafer (1976), Mathematical Theory of Evidence, Princeton University Press, Princeton.
G. Shafer, P.P. Shenoy, and Mellouli, K. (1987), Propagating belief functions in qualitative Markov trees, Int. J. of Approximate Reasoning, Vol. 1, pp. 349–400.
P.P. Shenoy (1994), Conditional Independence in Valuation-Based Systems, Int. J. of Approximate Reasoning, 10, pp. 203–234.
P. Smets (1993), Belief Functions: The Disjunctive Rule of Combination and the Generalized Bayesian Theorem, Int. J. of Approximate Reasoning, Vol. 1, pp. 349–400.
P. Smets (1998), The Transferable Belief Model for Quantified Belief Representation. In D.M. Gabbay and P. Smets (Eds.), Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 1, The Netherlands: Kluwer, pp. 349–400.
P. Smets and R. Kennes (1994), The Transferable Belief Model, Artificial Intelligence, 66, pp. 191–234.
M. Studeny (1993), Formal Properties of Conditional Independence in Different Calculi of Artificial Intelligence, ECSQARU’93, K. Clarke K., R. Kruse and S. Moral (Eds), Springer-Verlag, pp. 341–348.
J. Vejnarova (1999), Conditional Independence Relations in Possibility Theory, 1st International Symposium on Imprecise Probabilities and Their Applications ISIPTA’99, Ghent, pp. 343–351.
P. Walley (1991), Statistical Reasoning with Imprecise Probabilities, Chapman and Hall, London.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yaghlane, B.B., Smets, P., Mellouli, K. (2001). About Conditional Belief Function Independence. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_30
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive