Finding Optimal Exact Reducts

Hassan AbouEisha

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.

References

  1. A. Asuncion, D. N. (2007). UCI machine learning repository.
  2. AbouEisha, H., Farhan, M. A., Chikalov, I., and Moshkov, M. (2013). An algorithm for reduct cardinality minimization. In GrC, pages 1-3.
  3. Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., and Zielosko, B. (2011). Dagger: A tool for analysis and optimization of decision trees and rules. Computational Informatics, Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiences in the Era of Communicability Expansion, pages 29-39.
  4. Feige, U. (1998). A threshold of ln n for approximating set cover. J. ACM, 45(4):634-652.
  5. Hoa, N. S. and Son, N. H. (1996). Some efficient algorithms for rough set methods. Proceedings of the sixth International Conference on Information Processing Management of Uncertainty in Knowledge Based Systems, pages 1451-1456.
  6. Moshkov, M. J., Piliszczuk, M., and Zielosko, B. (2008). Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications, volume 145 of Studies in Computational Intelligence. Springer.
  7. Pawlak, Z. (1992). Rough Sets: Theoretical Aspects of Reasoning About Data. Kluwer Academic Publishers, Norwell, MA, USA.
  8. Pawlak, Z. and Skowron, A. (2007). Rudiments of rough sets. Information Sciences, 177(1):3-27.
  9. Skowron, A. and Rauszer, C. (1992). The discernibility matrices and functions in information systems. In Intelligent Decision Support, pages 331-362. Springer Netherlands.
  10. Wroblewski, J. (1995). Finding minimal reducts using genetic algorithms. In Proccedings of Second Joint Annual Conference on Information Sciences, pages 186- 189.
Download


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