The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
type: Item
instance of: scholarly article
title: The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
zbMATH Open document ID: 1459.90190
DOI: 10.1155/2020/5359691
author: Jinjin Li
author: Qing-Yuan Xu
published in: Mathematical Problems in Engineering
publication date: 2020-07-13T00:00:00Z
review text: Summary: The unicost set covering problem and the attribute reduction problem are NP-complete problems. In this paper, the relationship between these two problems are discussed. Based on the transformability between attribute reductions and minimal solutions in unicost set covering models, two methods are provided. One is to induce an information table from a given unicost set covering model. With no doubt, it shows that the unicost set covering problem can be investigated by rough set theory. The other is to induce a unicost set covering model from a given information table. Similarly, it shows that the attribute reduction problem can be studied by set covering theory. As an application of the proposed theoretical results, a rough set heuristic algorithm is presented for the unicost set covering problem.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 90C70
zbMATH DE Number: 7219945
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2020/5359691
OpenAlex ID: W3035788012
cites work: A Heuristic Method for the Set Covering Problem
cites work: An effective and simple heuristic for the set covering problem
cites work: A GRASP algorithm to solve the unicost set covering problem
cites work: The Location of Emergency Service Facilities
cites work: Hybrid heuristics for minimum cardinality set covering problems
cites work: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
cites work: Solving hard set covering problems
cites work: A parallel genetic algorithm to solve the set-covering problem
cites work: An efficient mean field approach to the set covering problem
cites work: Rough sets
cites work: Soft sets and soft rough sets
cites work: Fuzzy preference based rough sets
cites work: Discernibility matrix simplification for constructing attribute reducts
cites work: Q4507827
cites work: Q5472950
cites work: Q4458143
cites work: Knowledge reduction in random information systems via Dempster-Shafer theory of evidence
cites work: Quick attribute reduction in inconsistent decision tables
cites work: Q3745324
cites work: Q3346320
cites work: A set covering based approach to find the reduct of variable precision rough set
cites work: A set-cover-based approach for the test-cost-sensitive attribute reduction problem
cites work: Soft set theory -- first results
cites work: \(N\)-soft sets and their decision making algorithms
cites work: Q4003537
cites work: Q5472895
cites work: Reduction algorithms based on discernibility matrix: The ordered attributes method
cites work: Q4024050
cites work: Positive approximation: an accelerator for attribute reduction in rough set theory
cites work: THE INFORMATION ENTROPY, ROUGH ENTROPY AND KNOWLEDGE GRANULATION IN ROUGH SET THEORY
cites work: COMBINATION ENTROPY AND COMBINATION GRANULATION IN ROUGH SET THEORY
cites work: A hierarchical model for test-cost-sensitive decision systems
description: scientific article; zbMATH DE number 7219945