Generalisation of rough set for rule induction in incomplete system

Rough set models based on the tolerance and similarity relations, have been widely used to deal with incomplete information systems. However, tolerance and similarity relations have their own limitations because the former is too loose while the latter is too strict in classification analysis. To make a reasonable and flexible classification in incomplete information system, a new binary relation is proposed in this paper 1 . Such binary relation is only reflexive and it is a generalisation of tolerance and similarity relations. Furthermore, rough set models based on the above three different binary relations are compared. Finally, the direct approach to rules induction is investigated by using the proposed rough set, some illustrative examples are analysed to substantiate the conceptual arguments.

[1]  Jerzy W. Grzymala-Busse,et al.  Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction , 2004, Trans. Rough Sets.

[2]  Wei-Zhi Wu,et al.  Knowledge acquisition in incomplete fuzzy information systems via the rough set approach , 2003, Expert Syst. J. Knowl. Eng..

[3]  Marzena Kryszkiewicz,et al.  Rough Set Approach to Incomplete Information Systems , 1998, Inf. Sci..

[4]  Janusz Zalewski,et al.  Rough sets: Theoretical aspects of reasoning about data , 1996 .

[5]  Wojciech Ziarko,et al.  DATA‐BASED ACQUISITION AND INCREMENTAL MODIFICATION OF CLASSIFICATION RULES , 1995, Comput. Intell..

[6]  Alexis Tsoukiàs,et al.  Incomplete Information Tables and Rough Classification , 2001, Comput. Intell..

[7]  Wang Guo,et al.  EXTENSION OF ROUGH SET UNDER INCOMPLETE INFORMATION SYSTEMS , 2002 .

[8]  Jing-Yu Yang,et al.  Dominance-based rough set approach and knowledge reductions in incomplete ordered information system , 2008, Inf. Sci..

[9]  Jing-yu Yang,et al.  Further Investigation of Characteristic Relation in Incomplete Information System , 2007 .

[10]  Zdzislaw Pawlak,et al.  Rough Set Theory and its Applications to Data Analysis , 1998, Cybern. Syst..

[11]  Jerzy W. Grzymala-Busse,et al.  On the Unknown Attribute Values in Learning from Examples , 1991, ISMIS.

[12]  Yee Leung,et al.  Maximal consistent block technique for rule acquisition in incomplete information systems , 2003, Inf. Sci..

[13]  M. Narasimha Murty,et al.  Tree structure for efficient data mining using rough sets , 2003, Pattern Recognit. Lett..

[14]  Jing-Yu Yang,et al.  Credible rules in incomplete decision system based on descriptors , 2009, Knowl. Based Syst..

[15]  Zdzislaw Pawlak,et al.  Rough sets and intelligent data analysis , 2002, Inf. Sci..

[16]  Tzung-Pei Hong,et al.  Learning rules from incomplete training examples by rough sets , 2002, Expert Syst. Appl..

[17]  Andrzej Skowron,et al.  Rough set methods in feature selection and recognition , 2003, Pattern Recognit. Lett..

[18]  Wei-Zhi Wu,et al.  Attribute reduction based on evidence theory in incomplete decision systems , 2008, Inf. Sci..

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

[20]  Ivo Düntsch,et al.  Maximum Consistency of Incomplete Data via Non-Invasive Imputation , 2004, Artificial Intelligence Review.

[21]  Chien-Chung Chan,et al.  A Rough Set Approach to Attribute Generalization in Data Mining , 1998, Inf. Sci..