Finding Optimal Exact Reducts

Hassan AbouEisha

2014

Abstract

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.

Paper Citation

in Harvard Style

AbouEisha H. (2014). Finding Optimal Exact Reducts . In Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014) ISBN 978-989-758-048-2, pages 149-153. DOI: 10.5220/0005035501490153

in Bibtex Style

@conference{kdir14,
author={Hassan AbouEisha},
title={Finding Optimal Exact Reducts},
booktitle={Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014)},
year={2014},
pages={149-153},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005035501490153},
isbn={978-989-758-048-2},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Knowledge Discovery and Information Retrieval - Volume 1: KDIR, (IC3K 2014)
TI - Finding Optimal Exact Reducts
SN - 978-989-758-048-2
AU - AbouEisha H.
PY - 2014
SP - 149
EP - 153
DO - 10.5220/0005035501490153