Abstract
When merging belief functions, Dempster rule of combination is justified only when information sources can be considered as independent. When this is not the case, one must find out a cautious merging rule that adds a minimal amount of information to the inputs. Such a rule is said to follow the principle of minimal commitment. Some conditions it should comply with are studied. A cautious merging rule based on maximizing expected cardinality of the resulting belief function is proposed. It recovers the minimum operation when specialized to possibility distributions. This form of the minimal commitment principle is discussed, in particular its discriminating power and its justification when some conflict is present between the belief functions.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baudrit, C., Dubois, D.: Practical representations of incomplete probabilistic knowledge. Computational Statistics and Data Analysis 51(1), 86–108 (2006)
Cattaneo, M.: Combining belief functions issued from dependent sources. In: Proc. Third International Symposium on Imprecise Probabilities and Their Application (ISIPTA 2003), Lugano, Switzerland, pp. 133–147 (2003)
Chateauneuf, A.: Combination of compatible belief functions and relation of specificity. In: Advances in the Dempster-Shafer theory of evidence, pp. 97–114. John Wiley & Sons, New York (1994)
Dempster, A.: Upper and lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics 38, 325–339 (1967)
Denoeux, T.: Conjunctive and disjunctive combination of belief functions induced by non distinct bodies of evidence. Artificial Intelligence (to appear)
Destercke, S., Dubois, D.: A unified view of some representations of imprecise probabilities. In: Lawry, J., Miranda, E., Bugarin, A., Li, S. (eds.) Int. Conf. on Soft Methods in Probability and Statistics (SMPS), Advances in Soft Computing, Bristol, pp. 249–257. Springer, Heidelberg (2006)
Dubois, D., Prade, H.: A set-theoretic view on belief functions: logical operations and approximations by fuzzy sets. I. J. of General Systems 12, 193–226 (1986)
Dubois, D., Yager, R.: Fuzzy set connectives as combination of belief structures. Information Sciences 66, 245–275 (1992)
Ferson, S., Ginzburg, L., Kreinovich, V., Myers, D., Sentz, K.: Constructing probability boxes and dempster-shafer structures. Technical report, Sandia National Laboratories (2003)
Shafer, G.: A mathematical Theory of Evidence. Princeton University Press, Princeton (1976)
Smets, P.: The canonical decomposition of a weighted belief. In: Proc. Int. Joint, Montreal, pp. 1896–1901 (1995)
Smets, P.: Quantified possibility theory seen as an hyper cautious transferable belief model. In: Proceedings LFA 2000, La Rochelle. Cepadues-Editions Toulouse, pp. 343–353 (2000)
Smets, P.: Analyzing the combination of conflicting belief functions. Information Fusion 8, 387–412 (2007)
Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66, 191–234 (1994)
Walley, P.: Statistical reasoning with imprecise Probabilities. Chapman and Hall, Sydney (1991)
Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy sets and systems 1, 3–28 (1978)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Destercke, S., Dubois, D., Chojnacki, E. (2007). Cautious Conjunctive Merging of Belief Functions. In: Mellouli, K. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2007. Lecture Notes in Computer Science(), vol 4724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75256-1_31
Download citation
DOI: https://doi.org/10.1007/978-3-540-75256-1_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75255-4
Online ISBN: 978-3-540-75256-1
eBook Packages: Computer ScienceComputer Science (R0)