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

Authors :: Azad, Mohammad
Chikalov, Igor
Moshkov, Mikhail
Zielosko, Beata
Source :: Fundamenta Informaticae. 2012, Vol. 120 Issue 3-4, p231-242. 12p. 3 Diagrams, 4 Charts, 2 Graphs.
Publication Year :: 2012
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. [ABSTRACT FROM AUTHOR]

Subjects :: *DECISION logic tables
*GREEDY algorithms
*APPROXIMATION theory
*SET theory
*INFORMATION technology
*MACHINE learning
*BINARY number system

Full Text Access

Tools