Abstract
Uncertain databases are used in some fields to store both certain and uncertain data. When uncertainty is represented with the theory of belief functions, uncertain databases are assumed to be evidential. In this paper, we suggest a new method to quantify the source degree of dependence in order to enrich its evidential database by adding this dependence information. Enriching evidential databases with its sources degree of dependence can help user when making his decision. We used some generated mass functions to test the proposed method.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bach Tobji, M.-A., Ben Yaghlane, B., Mellouli, K.: A New Algorithm for Mining Frequent Itemsets from Evidential Databases. In: Information Processing and Management of Uncertainty (IPMU 2008), Malaga, Spain, pp. 1535–1542 (2008)
Ben Hariz, S., Elouedi, Z., Mellouli, K.: Clustering Approach Using Belief Function Theory. In: Euzenat, J., Domingue, J. (eds.) AIMSA 2006. LNCS (LNAI), vol. 4183, pp. 162–171. Springer, Heidelberg (2006)
Chebbah, M., Martin, A., Ben Yaghlane, B.: About sources dependence in the theory of belief functions. In: The 2nd International Conference on Belief Functions (BELIEF 2012), Compiègne, France (2012)
Dempster, A.P.: Upper and Lower probabilities induced by a multivalued mapping. Annals of Mathematical Statistics 38, 325–339 (1967)
Denoeux, T.: A k-nearest neighbor classification rule based on Dempster-Shafer theory. IEEE Transactions on Systems, Man and Cybernetics 25(5), 804–813 (1995)
Hewawasam, K.K.R.G.K., Premaratne, K., Subasingha, S.P., Shyu, M.-L.: Rule Mining and Classification in Imperfect Databases. In: Int. Conf. on Information Fusion, Philadelphia, USA, pp. 661–668 (2005)
Jousselme, A.-L., Grenier, D., Bossé, E.: A new distance between two bodies of evidence. Information Fusion 2, 91–101 (2001)
Masson, M.-H., Denoeux, T.: ECM: an evidential version of the fuzzy c-means algorithm. Pattern Recognition 41, 1384–1397 (2008)
Smets, P.: Belief Functions: the Disjunctive Rule of Combination and the Generalized Bayesian Theorem. International Journal of Approximate Reasoning 9, 1–35 (1993)
Smets, P., Kruse, R.: The transferable belief model for belief representation. In: Uncertainty in Information Systems: From Needs to Solutions, pp. 343–368 (1997)
Shafer, G.: A mathematical theory of evidence. Princeton University Press (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chebbah, M., Martin, A., Ben Yaghlane, B. (2012). Positive and Negative Dependence for Evidential Database Enrichment. In: Greco, S., Bouchon-Meunier, B., Coletti, G., Fedrizzi, M., Matarazzo, B., Yager, R.R. (eds) Advances in Computational Intelligence. IPMU 2012. Communications in Computer and Information Science, vol 299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31718-7_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-31718-7_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31717-0
Online ISBN: 978-3-642-31718-7
eBook Packages: Computer ScienceComputer Science (R0)