A logic method for efficient reduction of the space complexity of the attribute reduction problem

Basit Öğe Kaydı
dc.contributor.authorHacibeyoglu, Mehmet
dc.contributor.authorBasciftci, Fatih
dc.contributor.authorKahramanli, Sirzat
dc.date.accessioned2020-03-26T18:08:15Z
dc.date.available2020-03-26T18:08:15Z
dc.date.issued2011
dc.departmentSelçuk Üniversitesien_US
dc.description.abstractThe 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)(n/2)) 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 (1 - 2/((n)(n/2)) x 100) % of the implicants generated in the DF-to-DNF process are redundant ones. We prevented their generation based on the Boolean inverse distribution law. Due to this property, the proposed method generates 0.5 x ((n)(n/2)) times fewer implicants than other Boolean logic-based attribute reduction methods. Hence, it can process most of the datasets that cannot be processed by other attribute reduction methods.en_US
dc.description.sponsorshipSelcuk University, Konya, TurkeySelcuk Universityen_US
dc.description.sponsorshipThis work was supported by the Selcuk University Scientific Research Projects Coordinatorship, Konya, Turkey.en_US
dc.identifier.doi10.3906/elk-1008-726en_US
dc.identifier.endpage656en_US
dc.identifier.issn1300-0632en_US
dc.identifier.issue4en_US
dc.identifier.scopusqualityQ3en_US
dc.identifier.startpage643en_US
dc.identifier.urihttps://dx.doi.org/10.3906/elk-1008-726
dc.identifier.urihttps://hdl.handle.net/20.500.12395/26057
dc.identifier.volume19en_US
dc.identifier.wosWOS:000292016500010en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.indekslendigikaynakScopusen_US
dc.indekslendigikaynakTR-Dizinen_US
dc.language.isoenen_US
dc.publisherTUBITAK SCIENTIFIC & TECHNICAL RESEARCH COUNCIL TURKEYen_US
dc.relation.ispartofTURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCESen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.selcuk20240510_oaigen_US
dc.subjectInformation systemen_US
dc.subjectdataseten_US
dc.subjectattribute reductionen_US
dc.subjectfeature selectionen_US
dc.subjectdiscernibility functionen_US
dc.subjectcomputational complexityen_US
dc.subjectreducten_US
dc.titleA logic method for efficient reduction of the space complexity of the attribute reduction problemen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

WoS İndeksli Yayınlar Koleksiyonu
Scopus İndeksli Yayınlar Koleksiyonu
TR-Dizin İndeksli Yayınlar Koleksiyonu