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

DOI10.1155/2020/5359691zbMATH Open1459.90190OpenAlexW3035788012MaRDI QIDQ779535FDOQ779535

Authors Jinjin Li, Qing-Yuan Xu 

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) Reasoning under uncertainty in the context of artificial intelligence (68T37) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Recommendations

• An attribute reduction method based on rough sets for set covering problem
• The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
• A rough set method for the vertex cover problem in graph theory
• A set-cover-based approach for the test-cost-sensitive attribute reduction problem
• Some NP-complete problems for attribute reduction in consistent decision tables

Cites work

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

Cited in

(3)

• An attribute reduction method based on rough sets for set covering problem
• The relationship between attribute reducts in rough sets and minimal vertex covers of graphs
• A rough set method for the vertex cover problem in graph theory

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

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