Greedy algorithms for construction of approximate tests for decision tables with many-valued decisions
Type
ArticleKAUST Department
Applied Mathematics and Computational Science ProgramComputer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Date
2012-12-14Permanent link to this record
http://hdl.handle.net/10754/564642
Metadata
Show full item recordAbstract
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.Publisher
IOS PressJournal
Fundamenta Informaticaeae974a485f413a2113503eed53cd6c53
10.3233/FI-2012-759