Rough Mereology in Analysis of Vagueness

This work aims at presenting to a wider audience fundamental notions and ideas of rough mereology. We discuss various methods for constructing rough inclusions in data sets, then we show how to apply them to the task of knowledge granulation, and finally, we introduce granular reflections of data sets with examples of classifiers built on them.

[1]  Piotr Artiemjew,et al.  Rough Mereological Classifiers Obtained from Weak Variants of Rough Inclusions , 2008, RSKT.

[2]  Lech Polkowski,et al.  The Paradigm of Granular Rough Computing: Foundations and Applications , 2007, 6th IEEE International Conference on Cognitive Informatics.

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

[4]  Lech Polkowski,et al.  On the Idea of Using Granular Rough Mereological Structures in Classification of Data , 2008, RSKT.

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

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

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

[8]  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.

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

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

[11]  Andrzej Skowron,et al.  Rough Sets , 1995, Lecture Notes in Computer Science.

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

[13]  Piotr Artiemjew,et al.  On Classification of Data by Means of Rough Mereological Granules of Objects and Rules , 2008, RSKT.