Show simple item record

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

dc.contributor.authorAzad, Mohammad
dc.contributor.authorChikalov, Igor
dc.contributor.authorMoshkov, Mikhail
dc.contributor.authorZielosko, Beata
dc.date.accessioned2015-08-04T07:10:38Z
dc.date.available2015-08-04T07:10:38Z
dc.date.issued2012-12-14
dc.identifier.issn01692968
dc.identifier.doi10.3233/FI-2012-759
dc.identifier.urihttp://hdl.handle.net/10754/564642
dc.description.abstractThe 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.
dc.publisherIOS Press
dc.subjectDecision table with many-valued decisions
dc.subjectgreedy algorithm
dc.subjectreduct
dc.subjectset cover Problem
dc.subjecttest
dc.titleGreedy algorithms for construction of approximate tests for decision tables with many-valued decisions
dc.typeArticle
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentComputer Science Program
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.identifier.journalFundamenta Informaticae
kaust.personAzad, Mohammad
kaust.personChikalov, Igor
kaust.personMoshkov, Mikhail
kaust.personZielosko, Beata


This item appears in the following Collection(s)

Show simple item record