Nullity-based matroid of rough sets and its application to attribute reduction
From MaRDI portal
Publication:903646
DOI10.1016/j.ins.2013.11.014zbMath1328.68228OpenAlexW2055428278MaRDI QIDQ903646
Aiping Huang, William Zhu, Hong Zhao
Publication date: 14 January 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.11.014
Reasoning under uncertainty in the context of artificial intelligence (68T37) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (16)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Connectedness of graphs and its application to connected matroids through covering-based rough sets ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Dependency structures for decision tables ⋮ Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ The lattice and matroid representations of definable sets in generalized rough sets based on relations ⋮ Matrix approach to spanning matroids of rough sets and its application to attribute reduction ⋮ Decision region distribution preservation reduction in decision-theoretic rough set model ⋮ Graph and matrix approaches to rough sets through matroids ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ A rough set approach to the characterization of transversal matroids ⋮ The granular partition lattice of an information table ⋮ Unnamed Item ⋮ The structures and the connections on four types of covering rough sets ⋮ Class-specific attribute reducts in rough set theory ⋮ Granular computing on basic digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- The nullities for \(M\)-fuzzifying matroids
- Matroidal approaches to rough sets via closure operators
- Attribute reduction of data with error ranges and test costs
- Topological approaches to covering rough sets
- Attribute reduction in decision-theoretic rough set models
- The algebraic structures of generalized rough set theory
- Generalized rough sets based on reflexive and transitive relations
- Relationship between generalized rough sets based on binary relation and covering
- Rough sets and fuzzy sets
- Reduction and axiomization of covering generalized rough sets.
- Matroidal structure of rough sets from the viewpoint of graph theory
- Geometric lattice structure of covering-based rough sets through matroids
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Axiomatic systems for rough sets and fuzzy rough sets
- Binary nullity, Euler circuits and interlace polynomials
- Four matroidal structures of covering and their relationships with rough sets
- 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
- Generalized rough sets based on relations
- Rough matroids based on relations
- Rough sets
- Matroids and the greedy algorithm
- Axiomatic Systems of Generalized Rough Sets
This page was built for publication: Nullity-based matroid of rough sets and its application to attribute reduction
