Methods for robust clustering of epileptic EEG spikes.
We investigate algorithms for clustering of epileptic electroencephalogram (EEG) spikes. Such a method is useful prior to averaging and inverse computations since the spikes of a patient often belong to a few distinct classes. Data sets often contain outliers, which makes algorithms with robust performance desirable. We compare the fuzzy C-means (FCM) algorithm and a graph-theoretic algorithm. We give criteria for determination of the correct level of outlier contamination. The performance is then studied by aid of simulations, which show good results for a range of circumstances, for both algorithms. The graph-theoretic method gave better results than FCM for simulated signals. Also, when evaluating the methods on seven real-life data sets, the graph-theoretic method was the better method, in terms of closeness to the manual assessment by a neurophysiologist. However, there was some discrepancy between manual and automatic clustering and we suggest as an alternative method a human choice among a limited set of automatically obtained clusterings. Furthermore, we evaluate geometrically weighted feature extraction and conclude that it is useful as a supplementary dimension for clustering.
Department of Electrical Engineering and Computer Science, Lund University, Sweden. pw@tde.lth.se
P
P
Wahlberg
G
G
Lantz
D000465:Algorithms; D001698:Biomedical Engineering; D016000:Cluster Analysis; D003198:Computer Simulation; D004569:Electroencephalography / Q000706:statistics & numerical data*; D004827:Epilepsy / Q000503:physiopathology*; D006801:Humans