Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Mathematical Foundations
Rough Sets: Mathematical Foundations
Proceedings of the International Spring School on Mathematical Methods of Specification and Synthesis of Software Systems '85
A note on 3-valued rough logic accepting decision rules
Fundamenta Informaticae
Attribute reduction of data with error ranges and test costs
Information Sciences: an International Journal
An extension to rough c-means clustering algorithm based on boundary area elements discrimination
Transactions on Rough Sets XVI
| Hi-index | 0.00 |
Rough set theory is a paradigm for approximate reasoning based on a formal mathematical basis, viz., it assumes that concepts are divided into exact and non-exact (rough) ones by means of a topological structure induced by a representation of knowledge as a classification. A classification in its most simple form is an equivalence relation on a universe of objects; the classification induces a partition topology and concepts (subsets of the universe) that are clopen are exact whereas other concepts are rough. In consequence, rough sets are represented as pairs of exact sets of the form (interior, closure).In the paper, we propose a set theory RZF that represents formally exact and rough sets as satisfying or not a certain dichotomy based on a new form of membership in a set; this membership acquires a mereological character as it is based on containment. As a result, we propose a new form of set theory suitable as a set theory for rough sets.Logical models for reasoning in the framework of rough set theory were proposed and studied by many researchers, among them Orłowska, Orłowska and Pawlak, Rasiowa and Skowron, Vakarelov. We exploit here models of RZF as interpretation domains for rough mereological logics: intensional logics whose truth value assignment is based on rough inclusions - basic predicates of rough mereology, a paradigm for approximate reasoning introduced by Polkowski and Skowron.An application for those logics is proposed in semantic interpretation of vague statements forming the domain of Calculus of Perceptions proposed by Zadeh.