Electroencephalogram Signal Clustering With Convex Cooperative Games

Abstract

Currently, electroencephalogram (EEG) is mostly analyzed in a supervised way, which requires EEG labels (e.g., EEG classification). With the ever-increasing amount of unlabeled/mislabeled EEG in neuropsychiatric disorder diagnosis, BCI, and rehabilitation, manually labeling of EEG data is a labor intensive and time-consuming process, and few labs have developed algorithms to analyze EEG in an unsupervised manner (i.e., EEG clustering). In this paper, we propose a cooperative game inspired approach to cluster multi-trial EEG data. The idea is to map multi-trial EEG clustering to the coalition formation in a cooperative game, and then identify cluster center (the EEG trial with highest Shapley value) and assign EEG trials into proper clusters based on their cross correlation-transformed Shapley values. We demonstrate the mapped EEG cooperative game is convex, and it leads to an algorithm for multi-trial EEG clustering named CoGEEGc. The CoGEEGc yields high-quality multi-trial EEG clustering with respect to intra-cluster compactness and inter-cluster scatter. We show that CoGEEGc outperforms 15 state-of-the-art EEG or time series clustering approaches through detailed experimentation on real-world multi-trial EEG datasets. Comparison against 15 methods with four theoretical properties of clustering further illustrates the superiority of CoGEEGc, as it satisfies two properties while other approaches only satisfy one.