A New Type of Covering Rough Set

@article{Zhu2006ANT,
  title={A New Type of Covering Rough Set},
  author={W. Zhu and F. Wang},
  journal={2006 3rd International IEEE Conference Intelligent Systems},
  year={2006},
  pages={444-449}
}
  • W. Zhu, F. Wang
  • Published 2006
  • Computer Science
  • 2006 3rd International IEEE Conference Intelligent Systems
Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies a type of covering generalized rough sets. After presenting their basic properties, this paper explores the inter dependency between the lower and the upper approximation operations, conditions under which two coverings generate a same upper approximation operation, and the axiomatic systems for these operations. In the end, this paper establishes the relationships between this… Expand
The sixth type of covering-based rough sets
  • Jiao Liu, Zuhua Liao
  • Mathematics, Computer Science
  • 2008 IEEE International Conference on Granular Computing
  • 2008
TLDR
The interdependency between the lower and upper approximation operations, and condition under which two coverings generate an identical upper approximation operation, are explored. Expand
Topological approaches to covering rough sets
TLDR
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. Expand
Topological Approaches to the First Type of Covering-Based Rough Sets
  • Bin Chen, Jinjin Li
  • Mathematics
  • 2010 International Conference of Information Science and Management Engineering
  • 2010
Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies covering-based rough sets from the topological view. We explore the relationshipExpand
Properties of the First Type of Covering-Based Rough Sets
  • William Zhu, F. Wang
  • Computer Science
  • Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
  • 2006
TLDR
This paper studies covering-based generalized rough sets, where a covering can also generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. Expand
On Three Types of Covering-Based Rough Sets
TLDR
Three kinds of covering generalized rough sets for dealing with the vagueness and granularity in information systems are studied and the relationships among these three types of covering rough sets are explored. Expand
Properties of the Third Type of Covering-Based Rough Sets
  • W. Zhu, F. Wang
  • Mathematics
  • 2007 International Conference on Machine Learning and Cybernetics
  • 2007
Rough set theory has been proposed by Pawlak as a tool for dealing with the vagueness and granularity in information systems. The core concepts of classical rough sets are lower and upperExpand
Model of Covering Rough Sets in the Machine Intelligence
Rough set theory has been proposed by Pawlak as a useful tool for dealing with the vagueness and granularity in information systems. Classical rough set theory is based on equivalence relation. TheExpand
A New Type of Covering Approximation Operators
Rough set theory is a useful tool for data mining. It is based on equivalence relations of a universe. The covering rough sets is an improvement of Pawlak rough set to deal with complex practicalExpand
Properties of the Second Type of Covering-Based Rough Sets
  • William Zhu
  • Computer Science
  • 2006 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology Workshops
  • 2006
TLDR
This paper studies a class of covering-based generalized rough sets, in which a covering can generate a lower approximation operation and an upper approximation operation, but some of common properties of classical lower and upper approximation operations are no longer satisfied. Expand
Properties of the Fifth Type of Covering-Based Rough Sets
Rough set theory has been proposed by Pawlak as a useful tool for dealing with the vagueness and granularity in information systems. Classical rough set theory is based on equivalence relation. TheExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Topological approaches to covering rough sets
TLDR
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. Expand
Relationships among three types of covering rough sets
  • William Zhu, F. Wang
  • Mathematics, Computer Science
  • 2006 IEEE International Conference on Granular Computing
  • 2006
TLDR
This paper presents three kinds of covering generalized rough sets and explores the relationships among them and results are conditions under which two different types of upper approximation operations are identical. Expand
On the upper approximations of covering generalized rough sets
The covering generalized rough set is an improvement of Pawlak rough set to deal with more complex practical problems which the latter one cannot handle. However, many basic notions in this theoryExpand
Reduction and axiomization of covering generalized rough sets
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. Expand
Axiomatic Systems of Generalized Rough Sets
TLDR
This paper reviews and summarizes the axiomatic systems for classical rough sets, generalized rough sets based on binary relations, and generalized rough set based on coverings. Expand
Binary Relation Based Rough Sets
TLDR
It is proved that such a binary relation is unique, since two different binary relations will generate two different lower approximation operations and two different upper approximation operations. Expand
A Generalized Definition of Rough Approximations Based on Similarity
TLDR
New definitions of lower and upper approximations are proposed, which are basic concepts of the rough set theory and are shown to be more general, in the sense that they are the only ones which can be used for any type of indiscernibility or similarity relation. Expand
Rough Set Approach to Incomplete Information Systems
TLDR
This work proposes reduction of knowledge that eliminates only that information, which is not essential from the point of view of classification or decision making, and shows how to find decision rules directly from such an incomplete decision table. Expand
Logical properties of rough sets
  • F. Zhu, H. C. He
  • Computer Science
  • Proceedings Fourth International Conference/Exhibition on High Performance Computing in the Asia-Pacific Region
  • 2000
TLDR
The authors present a representation theorem of topological Boolean algebras, which is similar to Stone's representation result, which establishes the relationship between topology Boolean al gebras and rough sets in the general sets. Expand
Rough set theory applied to (fuzzy) ideal theory
  • J. Mordeson
  • Mathematics, Computer Science
  • Fuzzy Sets Syst.
  • 2001
TLDR
A particular cover of the universal set is defined on the set of ideals of a commutative ring with identity in such a way that both the concepts of the (fuzzy) prime spectrum of a ring and rough set theory can simultaneously be brought to bear on the study of ( fuzzy). Expand
...
1
2
3
4
5
...