A Spectral Clustering Approach for Modeling Connectivity Patterns in Electroencephalogram Sensor Networks

Electroencephalography (EEG) is a non-invasive low cost monitoring exam that is used for the study of the brain in every hospital and research labs. Time series recorded from EEG sensors can be studied from the perspective of computational neuroscience and network theory to extract meaningful features of the brain. In this chapter we present a network clustering approach for studying synchronization phenomena as captured by cross-correlation in EEG recordings. We demonstrate the proposed clustering idea in simulated data and in EEG recordings from patients with epilepsy.

[1]  F. Varela,et al.  Measuring phase synchrony in brain signals , 1999, Human brain mapping.

[2]  M. Fiedler.  A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory , 1975 .

[3]  K. Tsakalis,et al.  Long-term prospective on-line real-time seizure prediction , 2005, Clinical Neurophysiology.

[4]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  J. Goethe,et al.  EEG coherence and power changes during a continuous movement task. , 1986, International journal of psychophysiology : official journal of the International Organization of Psychophysiology.

[6]  Franz Rendl,et al.  A computational study of graph partitioning , 1994, Math. Program..

[7]  Rodrigo Quian Quiroga,et al.  Nonlinear multivariate analysis of neurophysiological signals , 2005, Progress in Neurobiology.

[8]  W. Art Chaovalitwongse,et al.  Adaptive epileptic seizure prediction system , 2003, IEEE Transactions on Biomedical Engineering.

[9]  Michalis E. Zervakis,et al.  Assessment of Linear and Nonlinear Synchronization Measures for Analyzing EEG in a Mild Epileptic Paradigm , 2009, IEEE Transactions on Information Technology in Biomedicine.

[10]  Cornelis J. Stam,et al.  Neural networks involved in mathematical thinking: evidence from linear and non-linear analysis of electroencephalographic activity , 2005, Neuroscience Letters.

[11]  Franz Rendl,et al.  A projection technique for partitioning the nodes of a graph , 1995, Ann. Oper. Res..

[12]  Panos M. Pardalos,et al.  Mining market data: A network approach , 2006, Comput. Oper. Res..

[13]  Andrew B. Kahng,et al.  New spectral methods for ratio cut partitioning and clustering , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Panos M. Pardalos,et al.  On maximum clique problems in very large graphs , 1999, External Memory Algorithms.

[15]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[16]  S M Pincus,et al.  Approximate entropy as a measure of system complexity. , 1991, Proceedings of the National Academy of Sciences of the United States of America.

[17]  M. Fiedler.  Algebraic connectivity of graphs , 1973 .

[18]  Alex Pothen,et al.  PARTITIONING SPARSE MATRICES WITH EIGENVECTORS OF GRAPHS* , 1990 .

[19]  R Quian Quiroga,et al.  Performance of different synchronization measures in real data: a case study on electroencephalographic signals. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.