Covering rough sets based on neighborhoods: an approach without using neighborhoods
From MaRDI portal
Publication:553978
DOI10.1016/j.ijar.2010.10.005zbMath1229.03047OpenAlexW1996202983WikidataQ60692192 ScholiaQ60692192MaRDI QIDQ553978
Publication date: 29 July 2011
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2010.10.005
Related Items
The rough membership function based on C 10 ¯ and its applications ⋮ Covering-based multigranulation decision-theoretic rough sets ⋮ Generalization of Pawlak's approximations in hypermodules by set-valued homomorphisms ⋮ Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Novel matrix-based approaches to computing minimal and maximal descriptions in covering-based rough sets ⋮ Reductions of a covering approximation space from algebraic points of view ⋮ On some types of covering rough sets from topological points of view ⋮ On generalizing covering approximation space ⋮ Covering based multigranulation \((\mathcal{I}, \mathcal{T})\)-fuzzy rough set models and applications in multi-attribute group decision-making ⋮ Nearness approximation space based on axiomatic fuzzy sets ⋮ The reduction and fusion of fuzzy covering systems based on the evidence theory ⋮ NMGRS: neighborhood-based multigranulation rough sets ⋮ Entropy and co-entropy of a covering approximation space ⋮ On some types of neighborhood-related covering rough sets ⋮ Covering-based multi-granulation fuzzy rough sets ⋮ Axiomatization of covering-based approximation operators generated by general or irreducible coverings ⋮ Some twin approximation operators on covering approximation spaces ⋮ On multi-granulation covering rough sets ⋮ A generalized modal logic in causal structures ⋮ An entropy-based uncertainty measurement approach in neighborhood systems ⋮ Extended results on the relationship between information systems ⋮ Some minimal axiom sets of rough sets ⋮ Characterizations of coverings for upper approximation operators being closure operators ⋮ Knowledge reduction of dynamic covering decision information systems when varying covering cardinalities ⋮ A Minimal Family of Sub-bases ⋮ Marcus-Wyse topological rough sets and their applications ⋮ Covering based rough set approximations ⋮ Topological characterizations of covering for special covering-based upper approximation operators ⋮ Relationships among generalized rough sets in six coverings and pure reflexive neighborhood system ⋮ Classification of coverings in the finite approximation spaces ⋮ Homomorphisms-based attribute reduction of dynamic fuzzy covering information systems ⋮ Maps between covering approximation spaces and the product space of two covering approximation spaces ⋮ Rough set approaches in knowledge structures ⋮ Fixed points of covering upper and lower approximation operators ⋮ Unnamed Item ⋮ Variable radius neighborhood rough sets and attribute reduction ⋮ Topological properties of locally finite covering rough sets and \(K\)-topological rough set structures ⋮ Sequences of topological near open and near closed sets with rough applications ⋮ Bitopological approximation space with application to data reduction in multi-valued information systems ⋮ Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets
Uses Software
Cites Work
- On rough sets and information system homomorphisms
- Topological approaches to covering rough sets
- Communicating between information systems
- Approximations and reducts with covering generalized rough sets
- The algebraic structures of generalized rough set theory
- Probabilistic rough set approximations
- Knowledge structure, knowledge granulation and knowledge distance in a knowledge base
- A comparison of two types of rough sets induced by coverings
- Monotonic variable consistency rough set approaches
- Variable-precision dominance-based rough set approach and attribute reduction
- A granularity-based framework of deduction, induction, and abduction
- Granular computing applied to ontologies
- Gaussian kernel based fuzzy rough sets: model, uncertainty measures and applications
- Reduction about approximation spaces of covering generalized rough sets
- On characterization of generalized interval-valued fuzzy rough sets on two universes of discourse
- Algebraic aspects of generalized approximation spaces
- Some improved results on communication between information systems
- Relationship between generalized rough sets based on binary relation and covering
- Rough sets in knowledge discovery 1. Methodology and applications
- Extensions and intensions in the rough set theory
- Constructive and algebraic methods of the theory of rough sets
- Rough sets and current trends in computing. 1st international conference, RSCTC '98, Warsaw, Poland, June 22--26, 1998. Proceedings
- Reduction and axiomization of covering generalized rough sets.
- Relational interpretations of neighborhood operators and rough set approximation operators
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- On characteristics of information system homomorphisms
- Relationship among basic concepts in covering-based rough sets
- A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
- Generalized rough sets based on relations
- Measuring roughness of generalized rough sets induced by a covering
- On the structure of generalized rough sets
- The algebra of topology
- An Improved Axiomatic Definition of Information Granulation
- Definability and Other Properties of Approximations for Generalized Indiscernibility Relations
- Rough sets
- Transactions on Rough Sets II
- Characteristic Relations for Incomplete Data: A Generalization of the Indiscernibility Relation
- On the Periodic Representations and the Reducibility of Periodic Automata
- Some theorems about the sentential calculi of Lewis and Heyting
- Invariant characters of information systems under some homomorphisms
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
