Covering cycle matroid
From MaRDI portal
Publication:469837
DOI10.1155/2013/539401zbMath1302.05025OpenAlexW2106412416WikidataQ58997428 ScholiaQ58997428MaRDI QIDQ469837
Publication date: 11 November 2014
Published in: ISRN Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/539401
Cites Work
- Unnamed Item
- Unnamed Item
- Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets
- On rough set and fuzzy sublattice
- Matroidal approaches to rough sets via closure operators
- Covering based rough set approximations
- Approaches to knowledge reduction of covering decision systems based on information theory
- Topological approaches to covering rough sets
- A novel approach to fuzzy rough sets based on a fuzzy covering
- A comparison of two types of rough sets induced by coverings
- Invertible approximation operators of generalized rough sets and fuzzy rough sets
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Relationship between generalized rough sets based on binary relation and covering
- On generalized intuitionistic fuzzy rough approximation operators
- Extensions and intensions in the rough set theory
- Reduction and axiomization of covering generalized rough sets.
- Matroidal structure of rough sets from the viewpoint of graph theory
- A multi-objective decision-making model with fuzzy rough coefficients and its application to the inventory problem
- Generalized fuzzy rough approximation operators based on fuzzy coverings
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- An Introduction to Matroid Theory
- On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
- Matroids and the greedy algorithm
