An algorithm for reduct cardinality minimization

Hassan M. AbouEisha, Mohammed Al Farhan, Igor Chikalov, Mikhail Moshkov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


This 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.
Original languageEnglish (US)
Title of host publication2013 IEEE International Conference on Granular Computing (GrC)
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages3
ISBN (Print)9781479912810
StatePublished - Dec 2013

Bibliographical note

KAUST Repository Item: Exported on 2020-10-01


Dive into the research topics of 'An algorithm for reduct cardinality minimization'. Together they form a unique fingerprint.

Cite this