A graph approach for fuzzy-rough feature selection
From MaRDI portal
Publication:2219196
DOI10.1016/j.fss.2019.07.014zbMath1452.68203OpenAlexW2966120476WikidataQ127409133 ScholiaQ127409133MaRDI QIDQ2219196
Jinkun Chen, Ju-Sheng Mi, Yao-Jin Lin
Publication date: 19 January 2021
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2019.07.014
Related Items (10)
A dynamic approach for updating the lower approximation in adjustable multi-granulation rough sets ⋮ Multigranulation fuzzy probabilistic rough set model on two universes ⋮ Fuzzy information entropy-based adaptive approach for hybrid feature outlier detection ⋮ Multigranular rough set model based on robust intuitionistic fuzzy covering with application to feature selection ⋮ Student-\(t\) kernelized fuzzy rough set model with fuzzy divergence for feature selection ⋮ An efficient feature selection algorithm based on the description vector and hypergraph ⋮ Graph neural networks induced by concept lattices for classification ⋮ Robust control of disturbed fractional-order economical chaotic systems with uncertain parameters ⋮ A fitting model for attribute reduction with fuzzy \(\beta\)-covering ⋮ Feature grouping and selection: a graph-based approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A fuzzy rough set approach for incremental feature selection on hybrid information systems
- Fuzzy-rough feature selection accelerator
- An effective and simple heuristic for the set covering problem
- Generalized fuzzy rough sets determined by a triangular norm
- Local reduction of decision system with fuzzy rough sets
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation
- Upper and lower images of a fuzzy set induced by a fuzzy relation: Applications to fuzzy inference and diagnosis
- Constructive and algebraic methods of the theory of rough sets
- An \(O(nm)\)-time algorithm for computing the dual of a regular Boolean function
- Constructive and axiomatic approaches of fuzzy approximation operators.
- An axiomatic characterization of a fuzzy generalization of rough sets.
- Towards scalable fuzzy-rough feature selection
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Attribute reduction based on \(k\)-nearest neighborhood rough sets
- Fuzzy rough set based incremental attribute reduction from dynamic data with sample arriving
- Three-way decision approaches to conflict analysis using decision-theoretic rough set theory
- Uncertainty measures for general fuzzy relations
- On characterizations of \((\mathcal J,\mathcal T)\)-fuzzy rough approximation operators
- Feature selection in mixed data: a method using a novel fuzzy rough set-based information entropy
- Experimental analysis of approximation algorithms for the vertex cover and set covering problems
- ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
- A Greedy Heuristic for the Set-Covering Problem
- Rough sets
- Fuzzy sets
This page was built for publication: A graph approach for fuzzy-rough feature selection
