2020
DOI: 10.1109/tevc.2020.2968743
|View full text |Cite
|
Sign up to set email alerts
|

Variable-Size Cooperative Coevolutionary Particle Swarm Optimization for Feature Selection on High-Dimensional Data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
85
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 225 publications
(85 citation statements)
references
References 56 publications
0
85
0
Order By: Relevance
“…Simply speaking, exploration is the process where solutions visit the un-visited spaces in anticipation of finding better solution, and exploitation means to plough a neighboring space effectively to discover more appropriate solution. Some of meta-heuristic cost based Feature Algorithms are proposed in [16], [17], [18], [19] . FS is considered as an optimization problem where we try to find the optimal set of relevant features [20].…”
Section: Introductionmentioning
confidence: 99%
“…Simply speaking, exploration is the process where solutions visit the un-visited spaces in anticipation of finding better solution, and exploitation means to plough a neighboring space effectively to discover more appropriate solution. Some of meta-heuristic cost based Feature Algorithms are proposed in [16], [17], [18], [19] . FS is considered as an optimization problem where we try to find the optimal set of relevant features [20].…”
Section: Introductionmentioning
confidence: 99%
“…As a wrapper-based meta-heuristic feature selection algorithm for optimal/highly discriminative feature selection, the BPSO helps minimize (if not eliminate) the curse of dimensionality caused by high-dimensional features; however, since the past decade when the canonical PSO was introduced, more than 4000 variants of the PSO algorithm has been developed including but not limited to the multiobjective PSO for cost-based feature selection in classification [39], variable-size cooperative co-evolutionary PSO for feature selection on high-dimensional data [40], Quantum PSO [41], Comprehensive Learning PSO [42], etc. Also, its capabilities as a filter-based feature selection approach has been recently explored by the authors of [43] who introduced the novel filter-based bare-bone particle swarm optimization(FBPSO) algorithm for unsupervised feature selection in cases of unlabelled data.…”
Section: B Meta-heuristic Methods For Feature Selectionmentioning
confidence: 99%
“…Filter [17] T-test [18], information theory [19], Distributed FS using SC [20] Wrapper [21] SVM [22], k-NN [23] Embedded [24] LASSO [25], Gradient boosting [26] Evolutionary computation EA [27] GA [28], parallel GA [29], GP [30] CEA [31] CCEA [32] Swarm optimization [28] PSO [28], ACO [33] Hybrid TLBO+GSA [34], CMIM+BGA [35], mRMR-TLBOL [36] Others DE [37], MA [38], ABC [37]…”
Section: Evaluation Criteriamentioning
confidence: 99%