Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions

Mohammad Azad, Igor Chikalov, Mikhail Moshkov, Beata Zielosko

Research output: Contribution to journalArticlepeer-review

4 Scopus citations

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.
Original languageEnglish (US)
Pages (from-to)231-242
Number of pages12
JournalFundamenta Informaticae
Volume120
Issue number3-4
DOIs
StatePublished - Dec 14 2012

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Algebra and Number Theory
  • Theoretical Computer Science
  • Information Systems

Fingerprint Dive into the research topics of 'Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions'. Together they form a unique fingerprint.

Cite this