Show simple item record

dc.contributor.authorAzad, Mohammad
dc.contributor.authorChikalov, Igor
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2015-08-04T07:16:42Z
dc.date.available2015-08-04T07:16:42Z
dc.date.issued2013-10
dc.identifier.isbn9780769551548
dc.identifier.doi10.1109/SMC.2013.81
dc.identifier.urihttp://hdl.handle.net/10754/564808
dc.description.abstractWe describe new heuristics to construct decision rules for decision tables with many-valued decisions from the point of view of length and coverage which are enough good. We use statistical test to find leaders among the heuristics. After that, we compare our results with optimal result obtained by dynamic programming algorithms. The average percentage of relative difference between length (coverage) of constructed and optimal rules is at most 6.89% (15.89%, respectively) for leaders which seems to be a promising result. © 2013 IEEE.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectDecision rules
dc.subjectDynamic programming
dc.subjectGreedy heuristics
dc.subjectMany-valued decisions
dc.subjectOptimization
dc.titleOptimization of decision rule complexity for decision tables with many-valued decisions
dc.typeConference Paper
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentApplied Mathematics and Computational Science Program
dc.contributor.departmentExtensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
dc.identifier.journal2013 IEEE International Conference on Systems, Man, and Cybernetics
dc.conference.date13 October 2013 through 16 October 2013
dc.conference.name2013 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2013
dc.conference.locationManchester
kaust.personAzad, Mohammad
kaust.personChikalov, Igor
kaust.personMoshkov, Mikhail


This item appears in the following Collection(s)

Show simple item record