Finding optimal exact reducts

Handle URI:
http://hdl.handle.net/10754/564870
Title:
Finding optimal exact reducts
Authors:
AbouEisha, Hassan M. ( 0000-0003-4560-7175 )
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.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division; Computer Science Program
Publisher:
Scitepress
Journal:
Proceedings of the International Conference on Knowledge Discovery and Information Retrieval
Conference/Event name:
6th International Conference on Knowledge Discovery and Information Retrieval, KDIR 2014
Issue Date:
2014
DOI:
10.5220/0005035501490153
Type:
Conference Paper
ISBN:
9789897580482
Appears in Collections:
Conference Papers; Computer Science Program; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorAbouEisha, Hassan M.en
dc.date.accessioned2015-08-04T07:23:40Zen
dc.date.available2015-08-04T07:23:40Zen
dc.date.issued2014en
dc.identifier.isbn9789897580482en
dc.identifier.doi10.5220/0005035501490153en
dc.identifier.urihttp://hdl.handle.net/10754/564870en
dc.description.abstractThe 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.en
dc.publisherScitepressen
dc.titleFinding optimal exact reductsen
dc.typeConference Paperen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.contributor.departmentComputer Science Programen
dc.identifier.journalProceedings of the International Conference on Knowledge Discovery and Information Retrievalen
dc.conference.date21 October 2014 through 24 October 2014en
dc.conference.name6th International Conference on Knowledge Discovery and Information Retrieval, KDIR 2014en
kaust.authorAbouEisha, Hassan M.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.