Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions

DOI10.3233/FI-2012-759zbMath1254.68250OpenAlexW1869137287MaRDI QIDQ4902317

Mohammad Azad, Beata Zielosko, Igor Chikalov, Mikhail Ju. Moshkov

Publication date: 14 January 2013

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2012-759

zbMATH Keywords

greedy algorithmtestreductset cover problemdecision table with many-valued decisions

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (1)

Three Approaches to Deal with Tests for Inconsistent Decision Tables – Comparative Study

This page was built for publication: Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions