Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables

DOI10.55630/sjc.2020.14.27-41OpenAlexW4285347581MaRDI QIDQ5868044

Pham Viet Anh, V. D. Thi, Phan Dang Khoa, Janos 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

zbMATH Keywords

computational complexityNP-completenessrough set theoryattribute reductionconsistent decision table

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rudiments of rough sets
• Attribute reduction based on consistent covering rough set and its application
• A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets
• Reduction of the decision table: A rough approach
• Rough Set Attribute Reduction in Decision Systems

This page was built for publication: Some NP-Complete Problems for Attribute Reduction in Consistent Decision Tables