An algorithm for reduct cardinality minimization

Type
Conference Paper
Authors
AbouEisha, Hassan M. cc
Al Farhan, Mohammed cc
Chikalov, Igor
Moshkov, Mikhail cc
KAUST Department
Applied Mathematics and Computational Science Program
Computational 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-12
Permanent link to this record
http://hdl.handle.net/10754/564824

Metadata
Show full item record
Abstract
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.6740370
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Journal
2013 IEEE International Conference on Granular Computing (GrC)
Conference/Event name
2013 IEEE International Conference on Granular Computing, GrC 2013
ISBN
9781479912810
DOI
10.1109/GrC.2013.6740370
Collections
Conference Papers; Applied Mathematics and Computational Science Program; Computer Science Program; Computational Bioscience Research Center (CBRC); Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division