Nullity-based matroid of rough sets and its application to attribute reduction
From MaRDI portal
Recommendations
- Applications of matrices to a matroidal structure of rough sets
- Rough matroids based on relations
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- Graph and matrix approaches to rough sets through matroids
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
Cites work
- Attribute reduction in decision-theoretic rough set models
- Attribute reduction of data with error ranges and test costs
- Axiomatic Systems of Generalized Rough Sets
- Axiomatic systems for rough sets and fuzzy rough sets
- Binary nullity, Euler circuits and interlace polynomials
- Combinatorial optimization. Networks and matroids
- Four matroidal structures of covering and their relationships with rough sets
- Generalized rough sets based on reflexive and transitive relations
- Generalized rough sets based on relations
- Geometric lattice structure of covering-based rough sets through matroids
- Knowledge reduction based on the equivalence relations defined on attribute set and its power set
- Learning fuzzy rules from fuzzy samples based on rough set technique
- Matroidal approaches to rough sets via closure operators
- Matroidal structure of rough sets from the viewpoint of graph theory
- Matroids and the greedy algorithm
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Reduction and axiomization of covering generalized rough sets.
- Relationship between generalized rough sets based on binary relation and covering
- Rough matroids based on relations
- Rough sets
- Rough sets and fuzzy sets
- Temporal dynamics in information tables
- The algebraic structures of generalized rough set theory
- The nullities for \(M\)-fuzzifying matroids
- Topological approaches to covering rough sets
Cited in
(22)- The lattice and matroid representations of definable sets in generalized rough sets based on relations
- Indiscernibility structures induced from function sets: graph and digraph case
- Applications of matrices to a matroidal structure of rough sets
- New perspectives of granular computing in relation geometry induced by pairings
- Rough action on topological rough groups
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- A rough set approach to the characterization of transversal matroids
- Rough matroids based on relations
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Granular computing on basic digraphs
- The granular partition lattice of an information table
- Connectedness of graphs and its application to connected matroids through covering-based rough sets
- Dependency structures for decision tables
- Simplicial complexes and closure systems induced by indistinguishability relations
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Class-specific attribute reducts in rough set theory
- Class-specific information measures and attribute reducts for hierarchy and systematicness
- The structures and the connections on four types of covering rough sets
- Decision region distribution preservation reduction in decision-theoretic rough set model
- Graph and matrix approaches to rough sets through matroids
- Attribute reduction from closure operators and matroids in rough set theory
- Geometric lattice structure of covering and its application to attribute reduction through matroids
This page was built for publication: Nullity-based matroid of rough sets and its application to attribute reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q903646)
