2014 IEEE International Conference on Cluster Computing (CLUSTER) 2014
DOI: 10.1109/cluster.2014.6968782
|View full text |Cite
|
Sign up to set email alerts
|

Feature selection in high-dimensional EEG data by parallel multi-objective optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Year Published

2015
2015
2023
2023

Publication Types

Select...
4
1
1

Relationship

1
5

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 18 publications
0
6
0
Order By: Relevance
“…Moreover, clustering social media data streams are used as a tested application domain. Recently, the [62] presented a parallel implementation of a multi-objective feature selection. The algorithm makes possible use of high dimensional datasets when there are much more features than data items.…”
Section: E Parallel and Distributed-basedmentioning
confidence: 99%
“…Moreover, clustering social media data streams are used as a tested application domain. Recently, the [62] presented a parallel implementation of a multi-objective feature selection. The algorithm makes possible use of high dimensional datasets when there are much more features than data items.…”
Section: E Parallel and Distributed-basedmentioning
confidence: 99%
“…Most of these algorithms use an elitism-based strategy [163]. The application of evolutionary algorithms in BMI-based systems can be categorized into four major groups of filter design [57,58,[164][165][166], feature selection [61,[167][168][169][170][171][172][173][174], channel selection and optimal electrodes [52, 58-60, 175, 176], parameter selection and optimal classifier structure [9,68,69,[177][178][179][180][181][182][183][184], and finally improving the performance of control tools [185].…”
Section: Evolutionary Algorithms (Eas)mentioning
confidence: 99%
“…Moreover, speedup models have been considered and fitted to explain the experimental speedups obtained for the different procedures and benchmarks, and a comprehensive summary on the statistical significance of the obtained results in performance and speedups is also provided here. Indeed, the most detailed analysis (with respect to that provided in [19,20]) of the statistical significance of the performance and speedup differences among the considered procedures has allowed us to extract clearer conclusions about the behavior of the new procedure here proposed.…”
Section: Introductionmentioning
confidence: 99%
“…In [18], a large-scale feature selection algorithm based on the abilities of the features to explain the data variance is proposed.Nevertheless, these previous papers [15][16][17][18] have neither considered feature selection from a parallel multi-objective approach nor from a cooperative coevolutionary implementation as we propose here. In [19], we provide a first approach to feature selection by using a parallel multiobjective procedure that is extended in [20] with further benchmarks and a wider performance analysis. The parallel multi-objective procedures proposed there are extended here by considering them from a cooperative coevolutionary point of view.…”
mentioning
confidence: 99%