An efficient feature selection algorithm based on the description vector and hypergraph
From MaRDI portal
Publication:6127130
DOI10.1016/j.ins.2023.01.046OpenAlexW4315798197MaRDI QIDQ6127130
No author found.
Publication date: 10 April 2024
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2023.01.046
Cites Work
- Unnamed Item
- Unnamed Item
- Graph and matrix approaches to rough sets through matroids
- Neighborhood rough set based heterogeneous feature subset selection
- Reduction about approximation spaces of covering generalized rough sets
- Extensions and intensions in the rough set theory
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Hypergraph theory. An introduction
- A graph approach for fuzzy-rough feature selection
- Matrix-based set approximations and reductions in covering decision information systems
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Relationship among basic concepts in covering-based rough sets
- Generalized rough sets based on relations
- A systematic study on attribute reduction with rough sets based on general binary relations
- Related family: a new method for attribute reduction of covering information systems
- Rough sets
This page was built for publication: An efficient feature selection algorithm based on the description vector and hypergraph