Affiliations: Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia, {mohammad.azad, igor.chikalov, mikhail.moshkov, beata.zielosko}@kaust.edu.sa
Note: [] Also works: Institute of Computer Science, University of Silesia, 39, Będzińska St., Sosnowiec 41-200, Poland Address for correspondence: Mathematical and Computer Sciences & Engineering Division, King Abdullah University of Science and Technology, Thuwal 23955-6900, Saudi Arabia
Abstract: 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 row, we should find a decision from the set attached to this row. We consider bounds on the precision of this algorithm relative to the cardinality of tests.
Keywords: Decision table with many-valued decisions, test, reduct, greedy algorithm, set cover Problem
