Reduction of neighborhood-based generalized rough sets
Summary: Rough set theory is a powerful tool for dealing with uncertainty, granularity, and incompleteness of knowledge in information systems. This paper discusses five types of existing neighborhood-based generalized rough sets. The concepts of minimal neighborhood description and maximal neighborhood description of an element are defined, and by means of the two concepts the properties and structures of the third and the fourth types of neighborhood-based rough sets are deeply explored. Furthermore, we systematically study the covering reduction of the third and the fourth types of neighborhood-based rough sets in terms of the two concepts. Finally, two open problems posed by \textit{Z. Yun}, \textit{X. Ge} and \textit{X. Bai} [Inf. Sci. 181, No. 9, 1735--1740 (2011; Zbl 1216.68299)] are solved.
- Neighborhood system based rough set: models and attribute reductions
- Relationships between generalized rough sets based on covering and reflexive neighborhood system
- Generalized rough sets based on neighborhood systems and topological spaces
- Relationship between generalized rough sets based on binary relation and covering
- A rough set model based on fuzzifying neighborhood systems
- Approximations and reducts with covering generalized rough sets
- Axiomatization and conditions for neighborhoods in a covering to form a partition
- Covering based rough set approximations
- Developing Intelligent Applications in Social E-Mail Networks
- Extensions and intensions in the rough set theory
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- scientific article; zbMATH DE number 3831938 (Why is no real title available?)
- scientific article; zbMATH DE number 3880694 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 1983063 (Why is no real title available?)
- scientific article; zbMATH DE number 927110 (Why is no real title available?)
- Measuring roughness of generalized rough sets induced by a covering
- Reduction about approximation spaces of covering generalized rough sets
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Rough fuzzy approximations on two universes of discourse
- Rough sets: some extensions
- Topological approaches to covering rough sets
- Using rough sets with heuristics for feature selection
- Matroidal structure of rough sets from the viewpoint of graph theory
- Variable radius neighborhood rough sets and attribute reduction
- Positive macroscopic approximation for fast attribute reduction
- A neighborhood rough set model with nominal metric embedding
- Dominance-Based Neighborhood Rough Sets and Its Attribute Reduction
- New Neighborhood Based Rough Sets
- Neighborhood system based rough set: models and attribute reductions
- F-neighborhood rough set and its reduction
- Tri-partition neighborhood covering reduction for robust classification
- Incremental reduction methods based on granular ball neighborhood rough sets and attribute grouping
This page was built for publication: Reduction of neighborhood-based generalized rough sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642760)
