000894810 001__ 894810
000894810 005__ 20230531203013.0
000894810 0247_ $$2doi$$a10.1109/ACCESS.2021.3107901
000894810 0247_ $$2Handle$$a2128/28605
000894810 0247_ $$2WOS$$aWOS:000692224900001
000894810 037__ $$aFZJ-2021-03405
000894810 041__ $$aEnglish
000894810 082__ $$a621.3
000894810 1001_ $$0P:(DE-Juel1)185971$$aAlia, Ahmed$$b0$$eCorresponding author$$ufzj
000894810 245__ $$aEnhanced Binary Cuckoo Search With Frequent Values and Rough Set Theory for Feature Selection
000894810 260__ $$aNew York, NY$$bIEEE$$c2021
000894810 3367_ $$2DRIVER$$aarticle
000894810 3367_ $$2DataCite$$aOutput Types/Journal article
000894810 3367_ $$0PUB:(DE-HGF)16$$2PUB:(DE-HGF)$$aJournal Article$$bjournal$$mjournal$$s1631021713_12534
000894810 3367_ $$2BibTeX$$aARTICLE
000894810 3367_ $$2ORCID$$aJOURNAL_ARTICLE
000894810 3367_ $$00$$2EndNote$$aJournal Article
000894810 520__ $$aRedundant and irrelevant features in datasets decrease classification accuracy, and increase computational time of classification algorithms, overfitting problem and complexity of the underlying classification model. Feature selection is a preprocessing technique used in classification algorithms to improve the selection of relevant features. Several approaches that combine Rough Set Theory (RST) with Nature Inspired Algorithms (NIAs) have been used successfully for feature selection. However, due to the inherit limitations of RST for some data types and the inefficient convergence of NIAs for high dimensional datasets, these approaches have mainly focused on a specific type of low dimensional nominal dataset. This paper proposes a new filter feature selection approach based on Binary Cuckoo Search (BCS) and RST, which is more efficient for low and high dimensional nominal, mixed and numerical datasets. It enhances BCS by developing a new initialization and global update mechanisms to increase the efficiency of convergence for high dimensional datasets. It also develops a more efficient objective function for numerical, mixed and nominal datasets. The proposed approach was validated on 16 benchmark datasets; 4 nominal, 4 mixed and 8 numerical drawn from the UCI repository. It was also evaluated against standard BCS; five NIAs with fuzzy RST approaches; two popular traditional FS approaches; and multi objective evolutionary, Genetic, and Particle Swarm Optimization (PSO) algorithms. Decision tree and Naive Bayes algorithms were used to measure the classification performance of the proposed approach. The results show that the proposed approach achieved improved classification accuracy while minimizing the number of features compared to other state-of-the-art methods.
000894810 536__ $$0G:(DE-HGF)POF4-5111$$a5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)$$cPOF4-511$$fPOF IV$$x0
000894810 588__ $$aDataset connected to CrossRef, Journals: juser.fz-juelich.de
000894810 7001_ $$0P:(DE-HGF)0$$aTaweel, Adel$$b1
000894810 773__ $$0PERI:(DE-600)2687964-5$$a10.1109/ACCESS.2021.3107901$$gVol. 9, p. 119430 - 119453$$p119430 - 119453$$tIEEE access$$v9$$x2169-3536$$y2021
000894810 8564_ $$uhttps://juser.fz-juelich.de/record/894810/files/Enhanced_Binary_Cuckoo_Search_With_Frequent_Values_and_Rough_Set_Theory_for_Feature_Selection.pdf$$yOpenAccess
000894810 8767_ $$d2023-05-31$$eAPC$$jPublish and Read$$zToken
000894810 909CO $$ooai:juser.fz-juelich.de:894810$$pVDB$$pdriver$$pOpenAPC$$popen_access$$popenaire$$popenCost$$pdnbdelivery
000894810 9101_ $$0I:(DE-588b)5008462-8$$6P:(DE-Juel1)185971$$aForschungszentrum Jülich$$b0$$kFZJ
000894810 9131_ $$0G:(DE-HGF)POF4-511$$1G:(DE-HGF)POF4-510$$2G:(DE-HGF)POF4-500$$3G:(DE-HGF)POF4$$4G:(DE-HGF)POF$$9G:(DE-HGF)POF4-5111$$aDE-HGF$$bKey Technologies$$lEngineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action$$vEnabling Computational- & Data-Intensive Science and Engineering$$x0
000894810 9141_ $$y2021
000894810 915__ $$0StatID:(DE-HGF)0200$$2StatID$$aDBCoverage$$bSCOPUS$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0160$$2StatID$$aDBCoverage$$bEssential Science Indicators$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)1230$$2StatID$$aDBCoverage$$bCurrent Contents - Electronics and Telecommunications Collection$$d2021-01-28
000894810 915__ $$0LIC:(DE-HGF)CCBY4$$2HGFVOC$$aCreative Commons Attribution CC BY 4.0
000894810 915__ $$0StatID:(DE-HGF)0100$$2StatID$$aJCR$$bIEEE ACCESS : 2019$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0501$$2StatID$$aDBCoverage$$bDOAJ Seal$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0500$$2StatID$$aDBCoverage$$bDOAJ$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0113$$2StatID$$aWoS$$bScience Citation Index Expanded$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0700$$2StatID$$aFees$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0150$$2StatID$$aDBCoverage$$bWeb of Science Core Collection$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)9900$$2StatID$$aIF < 5$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0510$$2StatID$$aOpenAccess
000894810 915__ $$0StatID:(DE-HGF)0030$$2StatID$$aPeer Review$$bDOAJ : Blind peer review$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0561$$2StatID$$aArticle Processing Charges$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)1160$$2StatID$$aDBCoverage$$bCurrent Contents - Engineering, Computing and Technology$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0300$$2StatID$$aDBCoverage$$bMedline$$d2021-01-28
000894810 915__ $$0StatID:(DE-HGF)0199$$2StatID$$aDBCoverage$$bClarivate Analytics Master Journal List$$d2021-01-28
000894810 915pc $$0PC:(DE-HGF)0000$$2APC$$aAPC keys set
000894810 915pc $$0PC:(DE-HGF)0001$$2APC$$aLocal Funding
000894810 915pc $$0PC:(DE-HGF)0002$$2APC$$aDFG OA Publikationskosten
000894810 915pc $$0PC:(DE-HGF)0003$$2APC$$aDOAJ Journal
000894810 9201_ $$0I:(DE-Juel1)IAS-7-20180321$$kIAS-7$$lZivile Sicherheitsforschung$$x0
000894810 9801_ $$aFullTexts
000894810 980__ $$ajournal
000894810 980__ $$aVDB
000894810 980__ $$aUNRESTRICTED
000894810 980__ $$aI:(DE-Juel1)IAS-7-20180321
000894810 980__ $$aAPC