Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Dataset

2011

Articles 1 - 1 of 1

Full-Text Articles in Computer Engineering

A Logic Method For Efficient Reduction Of The Space Complexity Of The Attribute Reduction Problem, Mehmet Hacibeyoğlu, Fati̇h Başçi̇ftçi̇, Şi̇rzat Kahramanli Jan 2011

A Logic Method For Efficient Reduction Of The Space Complexity Of The Attribute Reduction Problem, Mehmet Hacibeyoğlu, Fati̇h Başçi̇ftçi̇, Şi̇rzat Kahramanli

Turkish Journal of Electrical Engineering and Computer Sciences

The goal of attribute reduction is to find a minimal subset (MS) R of the condition attribute set C of a dataset such that R has the same classification power as C. It was proved that the number of MSs for a dataset with n attributes may be as large as (_{n/2}^n) and the generation of all of them is an NP-hard problem. The main reason for this is the intractable space complexity of the conversion of the discernibility function (DF) of a dataset to the disjunctive normal form (DNF). Our analysis of many DF-to-DNF conversion processes showed that approximately …