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 language||English (US)|
|Title of host publication||2013 IEEE International Conference on Granular Computing (GrC)|
|Publisher||Institute of Electrical and Electronics Engineers (IEEE)|
|Number of pages||3|
|State||Published - Dec 2013|