scispace - formally typeset
Journal ArticleDOI

Reduction and axiomization of covering generalized rough sets

William Zhu, +1 more
- 01 Jun 2003 - 
- Vol. 152, Iss: 1, pp 217-230
TLDR
It has been proved that the reduct of a covering is the minimal covering that generates theSame covering lower approximation or the same covering upper approximation, so this concept is also a technique to get rid of redundancy in data mining.
About
This article is published in Information Sciences.The article was published on 2003-06-01. It has received 699 citations till now. The article focuses on the topics: Rough set & Reduct.

read more

Citations
More filters
Journal ArticleDOI

Neighborhood rough set based heterogeneous feature subset selection

TL;DR: A neighborhood rough set model is introduced to deal with the problem of heterogeneous feature subset selection and Experimental results show that the neighborhood model based method is more flexible to deals with heterogeneous data.
Journal ArticleDOI

Topological approaches to covering rough sets

TL;DR: This paper explores the topological properties of covering-based rough sets, studies the interdependency between the lower and the upper approximation operations, and establishes the conditions under which two coverings generate the same lower approximation operation and the same upper approximation operation.
Journal ArticleDOI

Covering based rough set approximations

TL;DR: A framework for the study of covering based rough set approximations is proposed and three equivalent formulations of the classical rough sets are examined by using equivalence relations, partitions, and @s-algebras.
Journal ArticleDOI

Relationship between generalized rough sets based on binary relation and covering

TL;DR: The equivalency between this type of covering-based rough sets and a type of binary relation based rough sets is established and axiomatic systems for this type-of-covering lower and upper approximation operations are presented.
Journal ArticleDOI

On Three Types of Covering-Based Rough Sets

TL;DR: The relationships among the definable sets are investigated, and certain conditions that the union of the neighborhood and the complementary neighborhood is equal to the indiscernible neighborhood are presented.
References
More filters
Book

Fuzzy sets

TL;DR: A separation theorem for convex fuzzy sets is proved without requiring that the fuzzy sets be disjoint.
Journal ArticleDOI

The concept of a linguistic variable and its application to approximate reasoning—II☆

TL;DR: Much of what constitutes the core of scientific knowledge may be regarded as a reservoir of concepts and techniques which can be drawn upon to construct mathematical models of various types of systems and thereby yield quantitative information concerning their behavior.
Book

Rough Sets: Theoretical Aspects of Reasoning about Data

TL;DR: Theoretical Foundations.
Journal ArticleDOI

Fuzzy logic = computing with words

TL;DR: The point of this note is that fuzzy logic plays a pivotal role in CW and vice-versa and, as an approximation, fuzzy logic may be equated to CW.