Show simple item record

dc.contributor.authorAbouEisha, Hassan M.
dc.contributor.authorAl Farhan, Mohammed
dc.contributor.authorChikalov, Igor
dc.contributor.authorMoshkov, Mikhail
dc.date.accessioned2015-08-04T07:17:21Z
dc.date.available2015-08-04T07:17:21Z
dc.date.issued2013-12
dc.identifier.isbn9781479912810
dc.identifier.doi10.1109/GrC.2013.6740370
dc.identifier.urihttp://hdl.handle.net/10754/564824
dc.description.abstractThis is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. Results of computer experiments with decision tables from UCI ML Repository are discussed. © 2013 IEEE.
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.subjectdecision tree
dc.subjectdynamic programming
dc.subjectreduct
dc.titleAn algorithm for reduct cardinality minimization
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.contributor.departmentComputer Science Program
dc.identifier.journal2013 IEEE International Conference on Granular Computing (GrC)
dc.conference.date13 December 2013 through 15 December 2013
dc.conference.name2013 IEEE International Conference on Granular Computing, GrC 2013
dc.conference.locationBeijing
kaust.personAbouEisha, Hassan M.
kaust.personChikalov, Igor
kaust.personMoshkov, Mikhail
kaust.personAl Farhan, Mohammed


This item appears in the following Collection(s)

Show simple item record