A comprehensive study of implicator-conjunctor based and noise-tolerant fuzzy rough sets: definitions, properties and robustness analysis

© 2014 Elsevier B.V. Both rough and fuzzy set theories offer interesting tools for dealing with imperfect data: while the former allows us to work with uncertain and incomplete information, the latter provides a formal setting for vague concepts. The two theories are highly compatible, and since the late 1980s many researchers have studied their hybridization. In this paper, we critically evaluate most relevant fuzzy rough set models proposed in the literature. To this end, we establish a formally correct and unified mathematical framework for them. Both implicator-conjunctor-based definitions and noise-tolerant models are studied. We evaluate these models on two different fronts: firstly, we discuss which properties of the original rough set model can be maintained and secondly, we examine how robust they are against both class and attribute noise. By highlighting the benefits and drawbacks of the different fuzzy rough set models, this study appears a necessary first step to propose and develop new models in future research.Lynn D’eer has been supported by the Ghent University Special Research Fund, Chris Cornelis was partially supported by the Spanish Ministry of Science and Technology under the project TIN2011-28488 and the Andalusian Research Plans P11-TIC-7765 and P10-TIC-6858, and by project PYR-2014-8 of the Genil Program of CEI BioTic GRANADA and Lluis Godo has been partially supported by the Spanish MINECO project EdeTRI TIN2012-39348-C02-01Peer Reviewe

Covering rough sets based on neighborhoods: An approach without using neighborhoods

Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have been applied to covering rough sets. In this paper, we further investigate the covering rough sets based on neighborhoods by approximation operations. We show that the upper approximation based on neighborhoods can be defined equivalently without using neighborhoods. To analyze the coverings themselves, we introduce unary and composition operations on coverings. A notion of homomorphismis provided to relate two covering approximation spaces. We also examine the properties of approximations preserved by the operations and homomorphisms, respectively.Comment: 13 pages; to appear in International Journal of Approximate Reasonin

Certain and possible rules for decision making using rough set theory extended to fuzzy sets

Uncertainty may be caused by the ambiguity in the terms used to describe a specific situation. It may also be caused by skepticism of rules used to describe a course of action or by missing and/or erroneous data. To deal with uncertainty, techniques other than classical logic need to be developed. Although, statistics may be the best tool available for handling likelihood, it is not always adequate for dealing with knowledge acquisition under uncertainty. Inadequacies caused by estimating probabilities in statistical processes can be alleviated through use of the Dempster-Shafer theory of evidence. Fuzzy set theory is another tool used to deal with uncertainty where ambiguous terms are present. Other methods include rough sets, the theory of endorsements and nonmonotonic logic. J. Grzymala-Busse has defined the concept of lower and upper approximation of a (crisp) set and has used that concept to extract rules from a set of examples. We will define the fuzzy analogs of lower and upper approximations and use these to obtain certain and possible rules from a set of examples where the data is fuzzy. Central to these concepts will be the idea of the degree to which a fuzzy set A is contained in another fuzzy set B, and the degree of intersection of a set A with set B. These concepts will also give meaning to the statement; A implies B. The two meanings will be: (1) if x is certainly in A then it is certainly in B, and (2) if x is possibly in A then it is possibly in B. Next, classification will be looked at and it will be shown that if a classification will be looked at and it will be shown that if a classification is well externally definable then it is well internally definable, and if it is poorly externally definable then it is poorly internally definable, thus generalizing a result of Grzymala-Busse. Finally, some ideas of how to define consensus and group options to form clusters of rules will be given

Generalized closed sets in ditopological texture spaces with application in rough set theory

In this paper, the counterparts of generalized open (g-open) and generalized closed (g-closed) sets for ditopological texture spaces are introduced and some of their characterizations are obtained. Some characterizations are presented for generalized bicontinuous difunctions. Also, we introduce new notions of compactness and stability in ditopological texture spaces based on the notion of g-open and g-closed sets. Finally, as an application of g-open and g-closed sets, we generalize the subsystem based denition of rough set theory by using new subsystem, called generalized open sets to dene new types of lower and upper approximation operators, called g-lower and g-upper approximations. These decrease the upper approximation and increase the lower approximation and hence increase the accuracy. Properties of these approximations are studied. An example of multi-valued information systems are given

A comparison of two types of rough sets induced by coverings

Rough set theory is an important technique in knowledge discovery in databases. In covering-based rough sets, many types of rough set models were established in recent years. In this paper, we compare the covering-based rough sets defined by Zhu with ones defined by Xu and Zhang. We further explore the properties and structures of these types of rough set models. We also consider the reduction of coverings. Finally, the axiomatic systems for the lower and upper approximations defined by Xu and Zhang are constructed

Implicator-conjunctor based models of fuzzy rough sets: definitions and properties

Ever since the first hybrid fuzzy rough set model was proposed in the early 1990' s, many researchers have focused on the definition of the lower and upper approximation of a fuzzy set by means of a fuzzy relation. In this paper, we review those proposals which generalize the logical connectives and quantifiers present in the rough set approximations by means of corresponding fuzzy logic operations. We introduce a general model which encapsulates all of these proposals, evaluate it w.r.t. a number of desirable properties, and refine the existing axiomatic approach to characterize lower and upper approximation operators