On Granular Rough Computing with Missing Values

Granular Computing as a paradigm in Approximate Reasoning is concerned with granulation of available knowledge into granules that consists of entities similar in information content with respect to a chosen measure and with computing on such granules. Thus, operators acting on entities in a considered universe should factor through granular structures giving values similar to values of same operators in non---granular environment. Within rough set theory, proposed 25 years ago by Zdzislaw Pawlak and developed thence by many authors, granulation is also a vital area of research. The first author developed a calculus with granules as well as a granulation technique based on similarity measures called rough inclusions along with a hypothesis that granules induced in data set universe of objects should lead to new objects representing them, and such granular counterparts should preserve information content in data. In this work, this hypothesis is tested with missing values in data and results confirm the hypothesis in this context.

[1]  Lech Polkowski,et al.  Formal granular calculi based on rough inclusions , 2005, 2005 IEEE International Conference on Granular Computing.

[2]  Lech Polkowski,et al.  Toward Rough Set Foundations. Mereological Approach , 2004, Rough Sets and Current Trends in Computing.

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

[4]  J. D. Monk.  On the Foundations of Set Theory , 1970 .

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

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

[7]  Jerzy W. Grzymala-Busse,et al.  Transactions on Rough Sets I , 2004, Lecture Notes in Computer Science.

[8]  J. D. Monk.  On the Foundations of Set Theory , 1970 .

[9]  Lech Polkowski,et al.  Rough Sets in Knowledge Discovery 2 , 1998 .

[10]  Sinh Hoa Nguyen,et al.  Regularity analysis and its applications in data mining , 2000 .

[11]  Lech Polkowski,et al.  A model of granular computing with applications. granules from rough inclusions in information systems , 2006, 2006 IEEE International Conference on Granular Computing.

[12]  Andrzej Skowron,et al.  Rough mereology: A new paradigm for approximate reasoning , 1996, Int. J. Approx. Reason..

[13]  Tsau Young Lin,et al.  Rough Set Methods and Applications , 2000 .

[14]  Jan G. Bazan.  Chapter 17 a Comparison of Dynamic and Non{dynamic Rough Set Methods for Extracting Laws from Decision Tables , 1998 .

[15]  Marzena Kryszkiewicz,et al.  Data mining in incomplete information systems from rough set perspective , 2000 .

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

[17]  Renatus Ziegler,et al.  On the Foundations of Set Theory , 1996 .

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

[19]  Jerzy W. Grzymala-Busse,et al.  A Comparison of Several Approaches to Missing Attribute Values in Data Mining , 2000, Rough Sets and Current Trends in Computing.

[20]  Marzena Kryszkiewicz,et al.  Rules in Incomplete Information Systems , 1999, Inf. Sci..

[21]  Lech Polkowski,et al.  On Granular Rough Computing: Factoring Classifiers Through Granulated Decision Systems , 2007, RSEISP.