A set-cover-based approach for the test-cost-sensitive attribute reduction problem

DOI10.1007/S00500-016-2173-3MaRDI QIDQ1741935zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

attribute reductiondecision tablerough setset-cover problemtest cost

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• An attribute reduction method based on rough sets for set covering problem
• Attribute reduction of data with error ranges and test costs
• Test-cost-sensitive attribute reduction of data with normal distribution measurement errors
• Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
• Cost-sensitive rough set approach

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• A hierarchical model for test-cost-sensitive decision systems
• A set covering based approach to find the reduct of variable precision rough set
• A unified approach to reducts in dominance-based rough set approach
• Algorithms for the set covering problem
• An efficient local search heuristic with row weighting for the unicost set covering problem
• Attribute reduction of data with error ranges and test costs
• Conditional likelihood maximisation: a unifying framework for information theoretic feature selection
• Cost-sensitive feature reduction applied to a hybrid genetic algorithm
• Dependence-space-based attribute reduction in consistent decision tables
• Discernibility matrix simplification for constructing attribute reducts
• Feature selection with test cost constraint
• Fuzzy-rough feature selection accelerator
• scientific article; zbMATH DE number 53312 (Why is no real title available?)
• scientific article; zbMATH DE number 1256762 (Why is no real title available?)
• scientific article; zbMATH DE number 2059848 (Why is no real title available?)
• Minimum cost attribute reduction in decision-theoretic rough set models
• Positive approximation: an accelerator for attribute reduction in rough set theory
• Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model
• Test cost sensitive multigranulation rough set: model and minimal cost selection
• Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
• THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
• The relationship between attribute reducts in rough sets and minimal vertex covers of graphs

Cited in

(7)

• Matrix approach to spanning matroids of rough sets and its application to attribute reduction
• Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model
• Adaptive divide and conquer algorithm for cost-sensitive attribute reduction
• An attribute reduction method based on rough sets for set covering problem
• Attribute reduction of data with error ranges and test costs
• Test-cost-sensitive attribute reduction of data with normal distribution measurement errors
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory

Describes a project that uses

Uses Software

• UCI

This page was built for publication: A set-cover-based approach for the test-cost-sensitive attribute reduction problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741935)