Some NP-complete problems for attribute reduction in consistent decision tables
DOI10.55630/SJC.2020.14.27-41OpenAlexW4285347581MaRDI QIDQ5868044FDOQ5868044
Authors: Phan Dang Khoa, Vu Duc Thi, Pham Viet Anh, J. Demetrovics 
Publication date: 19 September 2022
Published in: Serdica Journal of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.55630/sjc.2020.14.27-41
Recommendations
Analysis of algorithms and problem complexity (68Q25) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Knowledge representation (68T30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rudiments of rough sets
- A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
- Rough Set Attribute Reduction in Decision Systems
- Title not available (Why is that?)
- Reduction of the decision table: A rough approach
- Attribute reduction based on consistent covering rough set and its application
- Title not available (Why is that?)
Cited In (6)
- Rough Sets and Current Trends in Computing
- On the time complexity of the problem related to reducts of consistent decision tables
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory
- On the complexity of redescription mining
- An efficient method to reduce the size of consistent decision tables
- The problem of finding the simplest classifier ensemble is NP-hard -- a rough-set-inspired formulation based on decision bireducts
This page was built for publication: Some NP-complete problems for attribute reduction in consistent decision tables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868044)
