Greedy Algorithms for Construction of Approximate Tests for Decision Tables with Many-Valued Decisions
Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Marta Zielosko · Fundamenta Informaticae · 2012
The paper is devoted to the study of a greedy algorithm for construction of approximate tests (super-reducts). This algorithm is applicable to decision tables with many-valued decisions where each row is labeled with a set of decisions. For a given r