Matroidal approaches to rough sets via closure operators
From MaRDI portal
Publication:448937
DOI10.1016/J.IJAR.2011.12.005zbMATH Open1246.68233OpenAlexW2079229074MaRDI QIDQ448937FDOQ448937
Authors: Xiaonan Li, Sanyang Liu 
Publication date: 11 September 2012
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2011.12.005
Recommendations
Reasoning under uncertainty in the context of artificial intelligence (68T37) Combinatorial aspects of matroids and geometric lattices (05B35) Galois correspondences, closure operators (in relation to ordered sets) (06A15) Topological spaces and generalizations (closure spaces, etc.) (54A05)
Cites Work
- Graph theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructive and axiomatic approaches of fuzzy approximation operators.
- Two views of the theory of rough sets in finite universes
- Relational interpretations of neighborhood operators and rough set approximation operators
- Title not available (Why is that?)
- Topological approaches to covering rough sets
- A comparison of two types of rough sets induced by coverings
- Constructive and algebraic methods of the theory of rough sets
- Title not available (Why is that?)
- Relationship between generalized rough sets based on binary relation and covering
- Rough sets in knowledge discovery 2. Applications, case studies and software systems
- Rough set theory for topological spaces
- Title not available (Why is that?)
- Reduction about approximation spaces of covering generalized rough sets
- The lattices of closure systems, closure operators, and implicational systems on a finite set: A survey
- Title not available (Why is that?)
- On the topological properties of fuzzy rough sets
- Topology vs generalized rough sets
- Lattices with Interior and Closure Operators and Abstract Approximation Spaces
- Title not available (Why is that?)
- Data mining, rough sets and granular computing
- Generalized rough sets (preclusivity fuzzy-intuitionistic (BZ) lattices)
- Title not available (Why is that?)
- Incomplete information: rough set analysis
- Connectedness of refined Goetschel-Voxman fuzzy matroids
Cited In (38)
- Topological approximations of multisets
- The lattice and matroid representations of definable sets in generalized rough sets based on relations
- Rough sets and matroids from a lattice-theoretic viewpoint
- Similarity of binary relations based on rough set theory and topology: an application for topological structures of matroids
- Generalization of Pawlak's rough approximation spaces by using \(\delta \beta \)-open sets
- New perspectives of granular computing in relation geometry induced by pairings
- A matroidal approach to rough set theory
- A rough set approach to the characterization of transversal matroids
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- Approximation via a double-matroid structure
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Idealization of j-approximation spaces
- Topological approach for rough sets by using J-nearly concepts via ideals
- Topological approaches to generalized rough multisets
- Title not available (Why is that?)
- Covering based rough set approximations
- Matrix representations and interdependency on \(L\)-fuzzy covering-based approximation operators
- On some types of neighborhood-related covering rough sets
- Granular computing on information tables: families of subsets and operators
- Covering cycle matroid
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- The matroidal structures of the second type of covering-based rough set
- Topologies generated by two ideals and the corresponding \(j\)-approximations spaces with applications
- Generalized matroids based on three-way decision models
- Lattice representations with set partitions induced by pairings
- The structures and the connections on four types of covering rough sets
- Dependence space models to construct concept lattices
- A categorical representation of algebraic domains based on variations of rough approximable concepts
- A new type of covering-based rough sets
- Algebraic representation, dualities and beyond
- Graph and matrix approaches to rough sets through matroids
- Generalized three-way decision models based on subset evaluation
- Convex rough sets on finite domains
- A new approach to generalized neighborhood system-based rough sets via convex structures and convex matroids
- Approximation Operators in Covering Based Rough Sets from Submodular Functions
- Nullity-based matroid of rough sets and its application to attribute reduction
- Four matroidal structures of covering and their relationships with rough sets
- A New Description of Transversal Matroids Through Rough Set Approach
This page was built for publication: Matroidal approaches to rough sets via closure operators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q448937)
