Abstract
In this paper, we propose two approaches of classification namely, Dynamic Belief Rough Set Classifier (D-BRSC) and Dynamic Belief Rough Set Classifier based on Generalization Distribution Table (D-BRSC-GDT). Both the classifiers are induced from uncertain data to generate classification rules. The uncertainty appears only in decision attribute values and is handled by the Transferable Belief Model (TBM), one interpretation of the belief function theory. D-BRSC only uses the basic concepts of Rough Sets (RS). However, D-BRSC-GDT is based on GDT-RS which is a hybridization of Generalization Distribution Table (GDT) and Rough Sets (RS). The feature selection step relative to the construction of the two classifiers uses the approach of dynamic reduct which extracts more relevant and stable features. The reduction of uncertain and noisy decision table using dynamic approach generates more significant decision rules for the classification of unseen objects. To prove that, we carry experimentations on real databases according to three evaluation criteria including the classification accuracy. We also compare the results of D-BRSC and D-BRSC-GDT with those obtained from Static Belief Rough Set Classifier (S-BRSC) and Static Belief Rough Set Classifier based on Generalization Distribution Table (S-BRSC-GDT). To further evaluate our rough sets based classification systems, we compare our results with those obtained from the Belief Decision Tree (BDT).
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
Bauer, M.: Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study. IJAR 17(2-3), 217–237 (1997)
Bazan, J., Skowron, A., Synak, P.: Dynamic reducts as a tool for extracting laws from decision tables. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1994. LNCS (LNAI), vol. 869, pp. 346–355. Springer, Heidelberg (1994)
Dong, J.Z., Zhong, N., Ohsuga, S.: Probabilistic rough induction: The GDT-RS methodology and algorithms. In: Raś, Z.W., Skowron, A. (eds.) ISMIS 1999. LNCS (LNAI), vol. 1609, pp. 621–629. Springer, Heidelberg (1999)
Elouedi, Z., Mellouli, K., Smets, P.: Belief decision trees: Theoretical foundations. International Journal of Approximate Reasoning 28(2-3), 91–124 (2001)
Elouedi, Z., Mellouli, K., Smets, P.: A Pre-Pruning Method in Belief Decision Trees. In: The Ninth International Conference on Information Processing and Management of uncertainty in Knowledge-Based Systems, IPMU 2002, Annecy, France, vol. 1, pp. 579–586 (2002)
Elouedi, Z., Mellouli, K., Smets, P.: Assessing sensor reliability for multisensor data fusion within the transferable belief model. IEEE Trans. Syst. Man Cyben. 34(1), 782–787 (2004)
Fixen, D., Mahler, R.P.S.: The modified Dempster-Shafer approach to classification. IEEE Trans Syst Man Cybern. 27(1), 96–104 (1997)
Grzymala-Busse, J.W.: Rough set strategies to data with missing attribute values. In: Workshop Notes, Foundations and New Directions of Data Mining, the 3rd International Conference on Data Mining, Melbourne, Florida, pp. 56–63 (2003)
Grzymala-Busse, J.W., Siddhaye, S.: Rough Set Approaches to Rule Induction from Incomplete Data. In: Proceedings of the IPMU 2004, Perugia, Itally, July 4-9, vol. 2, pp. 923–930 (2004)
Hong, T.P., Tseng, L.H., Chien, B.C.: Learning fuzzy rules from incomplete quantitative data by rough sets, pp. 1438–1442. IEEE, Los Alamitos (2002)
Jousseleme, A.L., Grenier, D., Bosse, E.: A new distance between two bodies of evidence. Information Fusion 2(2), 91–101 (2001)
Murphy, C.K.: Combining belief functions when evidence conflits. Decision Support Systems 29, 1–9 (2000)
Pawlak, Z.: Rough Sets. International Journal of Computer and Information Sciences 11(5), 341–356 (1982)
Pawlak, Z.: Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishing, Dordrecht (1991)
Shafer, G.: A mathematical theory of evidence. Princeton University Press, Princeton (1976)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support, pp. 331–362. Kluwer Academic Publishers, Boston (1992)
Skowron, A., Grzymala-Busse, J.W.: From rough set theory to evidence theory. In: Advances in the Dempster-Shafer Theory of Evidence, New York, pp. 193–236 (1994)
Smets, P., Kennes, R.: The transferable belief model. Artificial Intelligence 66(2), 191–234 (1994)
Smets, P.: The transferable belief model for quantified belief representation. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 267–301. Kluwer, Doordrecht (1998)
Smets, P.: Application of the transferable belief model to diagnostic problems. International Journal of Intelligent Systems 13(2-3), 127–157 (1998)
Tessem, B.: Approximations for efficient computation in the theory of evidence. Artif. Intell. 61(2), 315–329 (1993)
Trabelsi, S., Elouedi, Z., Mellouli, K.: Pruning belief decision tree methods in averaging and conjunctive approaches. International Journal of Approximate Reasoning 46, 91–124 (2007)
Trabelsi, S., Elouedi, Z.: Learning decision rules from uncertain data using rough sets. In: The 8th International FLINS Conference on Computational Intelligence in Decision and Control, Madrid, Spain, September 21-24, pp. 114–119. World Scientific, Singapore (2008)
Trabelsi, S., Elouedi, Z.: Heuristic method for attribute selection from partially uncertain data using rough sets. International Journal of General Systems 39(3), 271–290 (2010)
Trabelsi, S., Elouedi, Z., Lingras, P.: Dynamic reduct from partially uncertain data using rough sets. In: Sakai, H., Chakraborty, M.K., Hassanien, A.E., Ślęzak, D., Zhu, W. (eds.) RSFDGrC 2009. LNCS (LNAI), vol. 5908, pp. 160–167. Springer, Heidelberg (2009)
Trabelsi, S., Elouedi, Z., Lingras, P.: A comparison of dynamic and static belief rough set classifier. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds.) RSCTC 2010. LNCS (LNAI), vol. 6086, pp. 366–375. Springer, Heidelberg (2010)
Trabelsi, S., Elouedi, Z., Lingras, P.: Belief rough set classifier. In: Gao, Y., Japkowicz, N. (eds.) AI 2009. LNCS (LNAI), vol. 5549, pp. 257–261. Springer, Heidelberg (2009)
Trabelsi, S., Elouedi, Z., Lingras, P.: Rule discovery process based on rough sets under the belief function framework. In: Hüllermeier, E., Kruse, R., Hoffmann, F. (eds.) IPMU 2010. LNCS (LNAI), vol. 6178, pp. 726–736. Springer, Heidelberg (2010)
Zhong, N., Dong, J.Z., Ohsuga, S.: Data mining: A probabilistic rough set approach. In: Rough Sets in Knowledge Discovery, vol. 2, pp. 127–146 (1998)
Zhong, N., Ohsuga, S.: Using generalization distribution tables as a hypotheses search space for generalization. In: Proceedings of Fourth International Workshop on Rough Sets, Fuzzy Sets, and Machine Discovery, RSFD 1996, pp. 396–403 (1996)
Zouhal, L.M., Denoeux, T.: An evidence-theory k-NN rule with parameter optimization. IEEE Trans. Syst. Man Cybern. 28(2), 263–271 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Trabelsi, S., Elouedi, Z., Lingras, P. (2011). Classification with Dynamic Reducts and Belief Functions. In: Peters, J.F., et al. Transactions on Rough Sets XIV. Lecture Notes in Computer Science, vol 6600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21563-6_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-21563-6_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21562-9
Online ISBN: 978-3-642-21563-6
eBook Packages: Computer ScienceComputer Science (R0)