Graph and matrix approaches to rough sets through matroids
From MaRDI portal
Publication:508728
DOI10.1016/j.ins.2014.07.023zbMath1355.68265OpenAlexW2022353957MaRDI QIDQ508728
Fan Min, Qingxin Zhu, Shiping Wang, William Zhu
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
Reasoning under uncertainty in the context of artificial intelligence (68T37) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (8)
Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Class-specific information measures and attribute reducts for hierarchy and systematicness ⋮ An efficient feature selection algorithm based on the description vector and hypergraph ⋮ Matrix approach to spanning matroids of rough sets and its application to attribute reduction ⋮ The granular partition lattice of an information table ⋮ Finding strongly connected components of simple digraphs based on granulation strategy ⋮ Unnamed Item ⋮ Granular computing on basic digraphs
Cites Work
- Unnamed Item
- Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets
- Matroidal approaches to rough sets via closure operators
- Attribute reduction of data with error ranges and test costs
- An application of rough sets to graph theory
- Nullity-based matroid of rough sets and its application to attribute reduction
- Neighborhood rough set based heterogeneous feature subset selection
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Discernibility matrix simplification for constructing attribute reducts
- Rough sets in knowledge discovery 1. Methodology and applications
- Reduction and axiomization of covering generalized rough sets.
- Generalized fuzzy rough sets
- A matroidal approach to rough set theory
- Matroidal structure of rough sets based on serial and transitive relations
- Quantitative analysis for covering-based rough sets through the upper approximation number
- Axiomatic systems for rough sets and fuzzy rough sets
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Learning fuzzy rules from fuzzy samples based on rough set technique
- 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
- Generalized rough sets over fuzzy lattices
- Rough sets
- Non-convex clustering using expectation maximization algorithm with rough set initialization
- Transactions on Rough Sets I
- Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
- Matroids and the greedy algorithm
This page was built for publication: Graph and matrix approaches to rough sets through matroids
