TY - GEN
T1 - Finding optimal exact reducts
AU - AbouEisha, Hassan M.
N1 - KAUST Repository Item: Exported on 2020-10-01
PY - 2014
Y1 - 2014
N2 - The problem of attribute reduction is an important problem related to feature selection and knowledge discovery. The problem of finding reducts with minimum cardinality is NP-hard. This paper suggests a new algorithm for finding exact reducts with minimum cardinality. This algorithm transforms the initial table to a decision table of a special kind, apply a set of simplification steps to this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. I present results of computer experiments for a collection of decision tables from UCIML Repository. For many of the experimented tables, the simplification steps solved the problem.
AB - The problem of attribute reduction is an important problem related to feature selection and knowledge discovery. The problem of finding reducts with minimum cardinality is NP-hard. This paper suggests a new algorithm for finding exact reducts with minimum cardinality. This algorithm transforms the initial table to a decision table of a special kind, apply a set of simplification steps to this table, and use a dynamic programming algorithm to finish the construction of an optimal reduct. I present results of computer experiments for a collection of decision tables from UCIML Repository. For many of the experimented tables, the simplification steps solved the problem.
UR - http://hdl.handle.net/10754/564870
UR - http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0005035501490153
U2 - 10.5220/0005035501490153
DO - 10.5220/0005035501490153
M3 - Conference contribution
SN - 9789897580482
BT - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval
PB - SciTePress
ER -