A set-cover-based approach for the test-cost-sensitive attribute reduction problem
From MaRDI portal
Publication:1741935
DOI10.1007/s00500-016-2173-3zbMath1442.68234OpenAlexW2407982015MaRDI QIDQ1741935
Anhui Tan, Wei-Zhi Wu, Yuzhi Tao
Publication date: 11 April 2018
Published in: Soft Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00500-016-2173-3
Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items
Matrix approach to spanning matroids of rough sets and its application to attribute reduction, The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fuzzy-rough feature selection accelerator
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Dependence-space-based attribute reduction in consistent decision tables
- Attribute reduction of data with error ranges and test costs
- Test cost sensitive multigranulation rough set: model and minimal cost selection
- A set covering based approach to find the reduct of variable precision rough set
- Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
- Positive approximation: an accelerator for attribute reduction in rough set theory
- Discernibility matrix simplification for constructing attribute reducts
- The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
- Feature selection with test cost constraint
- A unified approach to reducts in dominance-based rough set approach
- A hierarchical model for test-cost-sensitive decision systems
- Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
- Minimum cost attribute reduction in decision-theoretic rough set models
- Cost-sensitive feature reduction applied to a hybrid genetic algorithm
- A Greedy Heuristic for the Set-Covering Problem
- THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
- Algorithms for the set covering problem
