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

Handle URI:
http://hdl.handle.net/10754/564642
Title:
Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions
Authors:
Azad, Mohammad ( 0000-0001-9851-1420 ) ; Chikalov, Igor; Moshkov, Mikhail ( 0000-0003-0085-9483 ) ; Zielosko, Beata
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Applied Mathematics and Computational Science Program; Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Publisher:
IOS Press
Journal:
Fundamenta Informaticae
Issue Date:
14-Dec-2012
DOI:
10.3233/FI-2012-759
Type:
Article
ISSN:
01692968
Appears in Collections:
Articles; Applied Mathematics and Computational Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAzad, Mohammaden
dc.contributor.authorChikalov, Igoren
dc.contributor.authorMoshkov, Mikhailen
dc.contributor.authorZielosko, Beataen
dc.date.accessioned2015-08-04T07:10:38Zen
dc.date.available2015-08-04T07:10:38Zen
dc.date.issued2012-12-14en
dc.identifier.issn01692968en
dc.identifier.doi10.3233/FI-2012-759en
dc.identifier.urihttp://hdl.handle.net/10754/564642en
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.en
dc.publisherIOS Pressen
dc.subjectDecision table with many-valued decisionsen
dc.subjectgreedy algorithmen
dc.subjectreducten
dc.subjectset cover Problemen
dc.subjecttesten
dc.titleGreedy algorithms for construction of approximate tests for decision tables with many-valued decisionsen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentApplied Mathematics and Computational Science Programen
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Groupen
dc.identifier.journalFundamenta Informaticaeen
kaust.authorAzad, Mohammaden
kaust.authorChikalov, Igoren
kaust.authorMoshkov, Mikhailen
kaust.authorZielosko, Beataen
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.