Finding optimal exact reducts

Hassan M. AbouEisha

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

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.
Original languageEnglish (US)
Title of host publicationProceedings of the International Conference on Knowledge Discovery and Information Retrieval
PublisherSciTePress
ISBN (Print)9789897580482
DOIs
StatePublished - 2014

Fingerprint Dive into the research topics of 'Finding optimal exact reducts'. Together they form a unique fingerprint.

Cite this