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.
Bibliographical noteKAUST Repository Item: Exported on 2020-10-01
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Algebra and Number Theory
- Theoretical Computer Science
- Information Systems