An algorithm for reduct cardinality minimization
Hassan AbouEisha, Mohammed A. Al Farhan, Igor Chikalov, Mikhail Moshkov · 2013
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.