TY - GEN
T1 - An algorithm for reduct cardinality minimization
AU - AbouEisha, Hassan M.
AU - Al Farhan, Mohammed
AU - Chikalov, Igor
AU - Moshkov, Mikhail
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2013/12
Y1 - 2013/12
N2 - 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.
AB - 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.
UR - http://hdl.handle.net/10754/564824
UR - http://ieeexplore.ieee.org/document/6740370/
UR - http://www.scopus.com/inward/record.url?scp=84900605420&partnerID=8YFLogxK
U2 - 10.1109/GrC.2013.6740370
DO - 10.1109/GrC.2013.6740370
M3 - Conference contribution
SN - 9781479912810
SP - 1
EP - 3
BT - 2013 IEEE International Conference on Granular Computing (GrC)
PB - Institute of Electrical and Electronics Engineers (IEEE)
ER -