The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory

DOI10.1155/2020/5359691zbMath1459.90190OpenAlexW3035788012MaRDI QIDQ779535

Publication date: 13 July 2020

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2020/5359691

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Quick attribute reduction in inconsistent decision tables
Soft sets and soft rough sets
A set covering based approach to find the reduct of variable precision rough set
An effective and simple heuristic for the set covering problem
A GRASP algorithm to solve the unicost set covering problem
Fuzzy preference based rough sets
Positive approximation: an accelerator for attribute reduction in rough set theory
Discernibility matrix simplification for constructing attribute reducts
A parallel genetic algorithm to solve the set-covering problem
A set-cover-based approach for the test-cost-sensitive attribute reduction problem
\(N\)-soft sets and their decision making algorithms
Solving hard set covering problems
Soft set theory -- first results
A hierarchical model for test-cost-sensitive decision systems
Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
Hybrid heuristics for minimum cardinality set covering problems
Rough sets
THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
A Heuristic Method for the Set Covering Problem
The Location of Emergency Service Facilities
Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
An efficient mean field approach to the set covering problem
Reduction algorithms based on discernibility matrix: The ordered attributes method

This page was built for publication: The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory