Onaran, İbrahimİnce, N. FıratAbosch, A.Çetin, A. Enis2016-02-082016-02-082012http://hdl.handle.net/11693/28078Date of Conference: 23-26 Sept. 2012Common Spatial Pattern algorithm (CSP) is widely used in Brain Machine Interface (BMI) technology to extract features from dense electrode recordings by using their weighted linear combination. However, the CSP algorithm, is sensitive to variations in channel placement and can easily overfit to the data when the number of training trials is insufficient. Construction of sparse spatial projections where a small subset of channels is used in feature extraction, can increase the stability and generalization capability of the CSP method. The existing 0 norm based sub-optimal greedy channel reduction methods are either too complex such as Backward Elimination (BE) which provided best classification accuracies or have lower accuracy rates such as Recursive Weight Elimination (RWE) and Forward Selection (FS) with reduced complexity. In this paper, we apply the Oscillating Search (OS) method which fuses all these greedy search techniques to sparsify the CSP filters. We applied this new technique on EEG dataset IVa of BCI competition III. Our results indicate that the OS method provides the lowest classification error rates with low cardinality levels where the complexity of the OS is around 20 times lower than the BE. © 2012 IEEE.EnglishBrain Machine InterfaceElectroencephalogram (EEG)Oscillating SearchSparse FilterAccuracy rateBackward eliminationBrain machine interfaceCardinalitiesChannel reductionClassification accuracyClassification error rateCommon spatial patternsData setsForward selectionGeneralization capabilityGreedy searchIn-channelsLinear combinationsOscillating SearchReduced complexitySparse FilterSpatial filtersTraining trialsAlgorithmsFeature extractionLearning systemsSignal processingElectroencephalographyConference Paper10.1109/MLSP.2012.6349752