Graph and matrix approaches to rough sets through matroids
From MaRDI portal
Publication:508728
DOI10.1016/J.INS.2014.07.023zbMATH Open1355.68265OpenAlexW2022353957MaRDI QIDQ508728FDOQ508728
Authors: Shiping Wang, Qingxin Zhu, William Zhu, Fan Min 
Publication date: 8 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.07.023
Recommendations
- Rough matroids based on relations
- Applications of matrices to a matroidal structure of rough sets
- Four operators of rough sets generalized to matroids and a matroidal method for attribute reduction
- Rough set characterization for 2-circuit matroid
- A rough set approach to the characterization of transversal matroids
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Reasoning under uncertainty in the context of artificial intelligence (68T37) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Rough sets
- Reduction and axiomization of covering generalized rough sets.
- Generalized fuzzy rough sets
- Axiomatic systems for rough sets and fuzzy rough sets
- Learning fuzzy rules from fuzzy samples based on rough set technique
- Generalized rough sets based on relations
- Generalized rough sets over fuzzy lattices
- Positive approximation: an accelerator for attribute reduction in rough set theory
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Matroids and the greedy algorithm
- Rough sets in knowledge discovery 1. Methodology and applications
- Relationship among basic concepts in covering-based rough sets
- Matroidal approaches to rough sets via closure operators
- Discernibility matrix simplification for constructing attribute reducts
- Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets
- Neighborhood rough set based heterogeneous feature subset selection
- A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets
- Transactions on Rough Sets I
- Attribute reduction of data with error ranges and test costs
- Quantitative analysis for covering-based rough sets through the upper approximation number
- An application of rough sets to graph theory
- A matroidal approach to rough set theory
- Matroidal structure of rough sets based on serial and transitive relations
- Non-convex clustering using expectation maximization algorithm with rough set initialization
- Title not available (Why is that?)
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Nullity-based matroid of rough sets and its application to attribute reduction
Cited In (23)
- Matrix representation and axiomatization of neighborhood-based rough sets
- Applications of matrices to a matroidal structure of rough sets
- 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
- Rough matroids based on relations
- Matrix approach to spanning matroids of rough sets and its application to attribute reduction
- Title not available (Why is that?)
- Title not available (Why is that?)
- Granular computing on basic digraphs
- The granular partition lattice of an information table
- Indiscernibility structures induced from function sets : Graph and digraph case
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- The properties of rough matroids based on equivalence relations
- Rough set characterization for 2-circuit matroid
- Class-specific information measures and attribute reducts for hierarchy and systematicness
- Incremental updating reduction for relation decision systems with dynamic conditional relation sets
- Finding strongly connected components of simple digraphs based on granulation strategy
- Title not available (Why is that?)
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Nullity-based matroid of rough sets and its application to attribute reduction
- An efficient feature selection algorithm based on the description vector and hypergraph
- A New Description of Transversal Matroids Through Rough Set Approach
- Rough Set Theory Applied to Simple Undirected Graphs
This page was built for publication: Graph and matrix approaches to rough sets through matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q508728)
