L. Ferariu, Corina Cimpanu, Tiberius Dumitriu, F. Ungureanu
{"title":"EEG Multi-Objective Feature Selection Using Temporal Extension","authors":"L. Ferariu, Corina Cimpanu, Tiberius Dumitriu, F. Ungureanu","doi":"10.1109/ICCP.2018.8516613","DOIUrl":null,"url":null,"abstract":"Nowadays Electroencephalogram (EEG) devices allow the recording of signals that can be used to extract information necessary to identify different types of cognitive processes. In EEG classification, Feature Selection (FS) represents a pivotal phase, as these problems request the processing of a large amount of high-dimensional patterns. In this paper, FS has been solved by an embedded multi-objective genetic optimization procedure which evolves a population of potential solutions (subsets of features), subject to the simultaneous minimization of the misclassification ratio and number of selected attributes. Random Forests (RF) classifiers are adopted, due to their fast training and their compatibility with spread classes of very diverse patterns. The main contribution presented in this paper consists in introducing an inertial behavior to feature extraction. The available feature set is extended with features from previous time frames, and FS is performed on this extended set. In this context, the experimental analysis illustrates the impact of the temporal extension on FS. Additionally, two enhancements are proposed for the multi-objective optimization, to support an effective Pareto-ranking of the solutions in the expanded exploration search space. Thus, the number of trees in the embedded RF classifier is gradually increased, for reducing the computational load requested for the evaluation of the misclassification ratio, without impeding the exploration. Also, the preference for the minimization of misclassifications is set by introducing a dynamic objective function for describing the parsimony of the selected subset of attributes. The proposed FS is experimentally demonstrated on EEG data collected during mathematical tasks of gradual complexities.","PeriodicalId":259007,"journal":{"name":"2018 IEEE 14th International Conference on Intelligent Computer Communication and Processing (ICCP)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 14th International Conference on Intelligent Computer Communication and Processing (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCP.2018.8516613","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
Nowadays Electroencephalogram (EEG) devices allow the recording of signals that can be used to extract information necessary to identify different types of cognitive processes. In EEG classification, Feature Selection (FS) represents a pivotal phase, as these problems request the processing of a large amount of high-dimensional patterns. In this paper, FS has been solved by an embedded multi-objective genetic optimization procedure which evolves a population of potential solutions (subsets of features), subject to the simultaneous minimization of the misclassification ratio and number of selected attributes. Random Forests (RF) classifiers are adopted, due to their fast training and their compatibility with spread classes of very diverse patterns. The main contribution presented in this paper consists in introducing an inertial behavior to feature extraction. The available feature set is extended with features from previous time frames, and FS is performed on this extended set. In this context, the experimental analysis illustrates the impact of the temporal extension on FS. Additionally, two enhancements are proposed for the multi-objective optimization, to support an effective Pareto-ranking of the solutions in the expanded exploration search space. Thus, the number of trees in the embedded RF classifier is gradually increased, for reducing the computational load requested for the evaluation of the misclassification ratio, without impeding the exploration. Also, the preference for the minimization of misclassifications is set by introducing a dynamic objective function for describing the parsimony of the selected subset of attributes. The proposed FS is experimentally demonstrated on EEG data collected during mathematical tasks of gradual complexities.