Type
Conference PaperKAUST Department
Applied Mathematics and Computational Science ProgramComputational Bioscience Research Center (CBRC)
Computer Science Program
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Extensions of Dynamic Programming, Machine Learning and Discrete Optimization Research Group
Office of the VP
Date
2013-12Permanent link to this record
http://hdl.handle.net/10754/564824
Metadata
Show full item recordAbstract
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.Citation
AbouEisha, H., Farhan, M. A., Chikalov, I., & Moshkov, M. (2013). An algorithm for reduct cardinality minimization. 2013 IEEE International Conference on Granular Computing (GrC). doi:10.1109/grc.2013.6740370Conference/Event name
2013 IEEE International Conference on Granular Computing, GrC 2013ISBN
9781479912810ae974a485f413a2113503eed53cd6c53
10.1109/GrC.2013.6740370