Classification with Dynamic Reducts and Belief Functions

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).

[1]  Ronald P. S. Mahler,et al.  The modified Dempster-Shafer approach to classification , 1997, IEEE Trans. Syst. Man Cybern. Part A.

[2]  Z. Pawlak Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[3]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[4]  Thierry Denoeux,et al.  An evidence-theoretic k-NN rule with parameter optimization , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[5]  J. Grzymala-Busse,et al.  Rough Set Approaches to Rule Induction from Incomplete Data , 2004 .

[6]  P. Smets Application of the transferable belief model to diagnostic problems , 1998 .

[7]  Eyke Hüllermeier,et al.  Computational Intelligence for Knowledge-Based Systems Design, 13th International Conference on Information Processing and Management of Uncertainty, IPMU 2010, Dortmund, Germany, June 28 - July 2, 2010. Proceedings , 2010, IPMU.

[8]  Zied Elouedi,et al.  LEARNING DECISION RULES FROM UNCERTAIN DATA USING ROUGH SETS , 2008 .

[9]  N. Zhong,et al.  Data Mining: A Probabilistic Rough Set Approach , 1998 .

[10]  Khaled Mellouli,et al.  Belief decision trees: theoretical foundations , 2001, Int. J. Approx. Reason..

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

[12]  Zbigniew W. Ras,et al.  Methodologies for Intelligent Systems , 1991, Lecture Notes in Computer Science.

[13]  Ning Zhong,et al.  Probabilistic Rough Induction: The GDT-RS Methodology and Algorithms , 1999, ISMIS.

[14]  Bjørnar Tessem,et al.  Approximations for Efficient Computation in the Theory of Evidence , 1993, Artif. Intell..

[15]  Zied Elouedi,et al.  Dynamic Reduct from Partially Uncertain Data Using Rough Sets , 2009, RSFDGrC.

[16]  Tzung-Pei Hong,et al.  Learning fuzzy rules from incomplete quantitative data by rough sets , 2002, 2002 IEEE World Congress on Computational Intelligence. 2002 IEEE International Conference on Fuzzy Systems. FUZZ-IEEE'02. Proceedings (Cat. No.02CH37291).

[17]  Zied Elouedi,et al.  A Comparison of Dynamic and Static Belief Rough Set Classifier , 2010, RSCTC.

[18]  Zied Elouedi,et al.  Belief Rough Set Classifier , 2009, Canadian Conference on AI.

[19]  Zied Elouedi,et al.  Heuristic method for attribute selection from partially uncertain data using rough sets , 2010, Int. J. Gen. Syst..

[20]  P. Smets,et al.  Assessing sensor reliability for multisensor data fusion within the transferable belief model , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[21]  Andrzej Skowron,et al.  From the Rough Set Theory to the Evidence Theory , 1991 .

[22]  Philippe Smets,et al.  The Transferable Belief Model , 1994, Artif. Intell..

[23]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[24]  Shusaku Tsumoto,et al.  Foundations of Intelligent Systems, 15th International Symposium, ISMIS 2005, Saratoga Springs, NY, USA, May 25-28, 2005, Proceedings , 2005, ISMIS.

[25]  Philippe Smets,et al.  The Transferable Belief Model for Quantified Belief Representation , 1998 .

[26]  Dov M. Gabbay,et al.  Handbook of defeasible reasoning and uncertainty management systems: volume 2: reasoning with actual and potential contradictions , 1998 .

[27]  Guoyin Wang,et al.  Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing , 2013, Lecture Notes in Computer Science.

[28]  Jerzy W. Grzymala-Busse,et al.  Rough Set Strategies to Data with Missing Attribute Values , 2006, Foundations and Novel Approaches in Data Mining.

[29]  Andrzej Skowron,et al.  The Discernibility Matrices and Functions in Information Systems , 1992, Intelligent Decision Support.

[30]  Andrzej Skowron,et al.  Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables , 1994, ISMIS.

[31]  Khaled Mellouli,et al.  Pruning belief decision tree methods in averaging and conjunctive approaches , 2007, Int. J. Approx. Reason..

[32]  Catherine K. Murphy Combining belief functions when evidence conflicts , 2000, Decis. Support Syst..

[33]  Roman Słowiński,et al.  Intelligent Decision Support , 1992, Theory and Decision Library.

[34]  Mathias Bauer,et al.  Approximation algorithms and decision making in the Dempster-Shafer theory of evidence - An empirical study , 1997, Int. J. Approx. Reason..

[35]  Zied Elouedi,et al.  Rule Discovery Process Based on Rough Sets under the Belief Function Framework , 2010, IPMU.

[36]  Éloi Bossé,et al.  A new distance between two bodies of evidence , 2001, Inf. Fusion.