Hauptseite > Publikationsdatenbank > Enhanced Binary Cuckoo Search With Frequent Values and Rough Set Theory for Feature Selection > print

001     894810
005     20230531203013.0
024 7 _ |a 10.1109/ACCESS.2021.3107901
|2 doi
024 7 _ |a 2128/28605
|2 Handle
024 7 _ |a WOS:000692224900001
|2 WOS
037 _ _ |a FZJ-2021-03405
041 _ _ |a English
082 _ _ |a 621.3
100 1 _ |a Alia, Ahmed
|0 P:(DE-Juel1)185971
|b 0
|e Corresponding author
|u fzj
245 _ _ |a Enhanced Binary Cuckoo Search With Frequent Values and Rough Set Theory for Feature Selection
260 _ _ |a New York, NY
|c 2021
|b IEEE
336 7 _ |a article
|2 DRIVER
336 7 _ |a Output Types/Journal article
|2 DataCite
336 7 _ |a Journal Article
|b journal
|m journal
|0 PUB:(DE-HGF)16
|s 1631021713_12534
|2 PUB:(DE-HGF)
336 7 _ |a ARTICLE
|2 BibTeX
336 7 _ |a JOURNAL_ARTICLE
|2 ORCID
336 7 _ |a Journal Article
|0 0
|2 EndNote
520 _ _ |a Redundant 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.
536 _ _ |a 5111 - Domain-Specific Simulation & Data Life Cycle Labs (SDLs) and Research Groups (POF4-511)
|0 G:(DE-HGF)POF4-5111
|c POF4-511
|f POF IV
|x 0
588 _ _ |a Dataset connected to CrossRef, Journals: juser.fz-juelich.de
700 1 _ |a Taweel, Adel
|0 P:(DE-HGF)0
|b 1
773 _ _ |a 10.1109/ACCESS.2021.3107901
|g Vol. 9, p. 119430 - 119453
|0 PERI:(DE-600)2687964-5
|p 119430 - 119453
|t IEEE access
|v 9
|y 2021
|x 2169-3536
856 4 _ |u https://juser.fz-juelich.de/record/894810/files/Enhanced_Binary_Cuckoo_Search_With_Frequent_Values_and_Rough_Set_Theory_for_Feature_Selection.pdf
|y OpenAccess
909 C O |o oai:juser.fz-juelich.de:894810
|p openaire
|p open_access
|p OpenAPC
|p driver
|p VDB
|p openCost
|p dnbdelivery
910 1 _ |a Forschungszentrum Jülich
|0 I:(DE-588b)5008462-8
|k FZJ
|b 0
|6 P:(DE-Juel1)185971
913 1 _ |a DE-HGF
|b Key Technologies
|l Engineering Digital Futures – Supercomputing, Data Management and Information Security for Knowledge and Action
|1 G:(DE-HGF)POF4-510
|0 G:(DE-HGF)POF4-511
|3 G:(DE-HGF)POF4
|2 G:(DE-HGF)POF4-500
|4 G:(DE-HGF)POF
|v Enabling Computational- & Data-Intensive Science and Engineering
|9 G:(DE-HGF)POF4-5111
|x 0
914 1 _ |y 2021
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0200
|2 StatID
|b SCOPUS
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0160
|2 StatID
|b Essential Science Indicators
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)1230
|2 StatID
|b Current Contents - Electronics and Telecommunications Collection
|d 2021-01-28
915 _ _ |a Creative Commons Attribution CC BY 4.0
|0 LIC:(DE-HGF)CCBY4
|2 HGFVOC
915 _ _ |a JCR
|0 StatID:(DE-HGF)0100
|2 StatID
|b IEEE ACCESS : 2019
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0501
|2 StatID
|b DOAJ Seal
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0500
|2 StatID
|b DOAJ
|d 2021-01-28
915 _ _ |a WoS
|0 StatID:(DE-HGF)0113
|2 StatID
|b Science Citation Index Expanded
|d 2021-01-28
915 _ _ |a Fees
|0 StatID:(DE-HGF)0700
|2 StatID
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0150
|2 StatID
|b Web of Science Core Collection
|d 2021-01-28
915 _ _ |a IF < 5
|0 StatID:(DE-HGF)9900
|2 StatID
|d 2021-01-28
915 _ _ |a OpenAccess
|0 StatID:(DE-HGF)0510
|2 StatID
915 _ _ |a Peer Review
|0 StatID:(DE-HGF)0030
|2 StatID
|b DOAJ : Blind peer review
|d 2021-01-28
915 _ _ |a Article Processing Charges
|0 StatID:(DE-HGF)0561
|2 StatID
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)1160
|2 StatID
|b Current Contents - Engineering, Computing and Technology
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0300
|2 StatID
|b Medline
|d 2021-01-28
915 _ _ |a DBCoverage
|0 StatID:(DE-HGF)0199
|2 StatID
|b Clarivate Analytics Master Journal List
|d 2021-01-28
915 p c |a APC keys set
|2 APC
|0 PC:(DE-HGF)0000
915 p c |a Local Funding
|2 APC
|0 PC:(DE-HGF)0001
915 p c |a DFG OA Publikationskosten
|2 APC
|0 PC:(DE-HGF)0002
915 p c |a DOAJ Journal
|2 APC
|0 PC:(DE-HGF)0003
920 1 _ |0 I:(DE-Juel1)IAS-7-20180321
|k IAS-7
|l Zivile Sicherheitsforschung
|x 0
980 1 _ |a FullTexts
980 _ _ |a journal
980 _ _ |a VDB
980 _ _ |a UNRESTRICTED
980 _ _ |a I:(DE-Juel1)IAS-7-20180321
980 _ _ |a APC

LibraryCollectionCLSMajorCLSMinorLanguageAuthor
Marc 21