Connectivity Analysis of Electroencephalograms in Epilepsy

This dissertation introduces a novel approach at gauging patterns of informa- tion flow using brain connectivity analysis and partial directed coherence (PDC) in epilepsy. The main objective of this dissertation is to assess the key characteristics that delineate neural activities obtained from patients with epilepsy, considering both focal and generalized seizures. The use of PDC analysis is noteworthy as it es- timates the intensity and direction of propagation from neural activities generated in the cerebral cortex, and it ascertains the coefficients as weighted measures in formulating the multivariate autoregressive model (MVAR). The PDC is used here as a feature extraction method for recorded scalp electroencephalograms (EEG) as means to examine the interictal epileptiform discharges (IEDs) and reflect the phys- iological changes of brain activity during interictal periods. Two experiments were set up to investigate the epileptic data by using the PDC concept. For the investigation of IEDs data (interictal spike (IS), spike and slow wave com- plex (SSC), and repetitive spikes and slow wave complex (RSS)), the PDC analysis estimates the intensity and direction of propagation from neural activities gener- ated in the cerebral cortex, and analyzes the coefficients obtained from employing MVAR. Features extracted by using PDC were transformed into adjacency matrices using surrogate data analysis and were classified by using the multilayer Perceptron (MLP) neural network. The classification results yielded a high accuracy and pre- cision number. The second experiment introduces the investigation of intensity (or strength) of information flow. The inflow activity deemed significant and flowing from other regions into a specific region together with the outflow activity emanating from one region and spreading into other regions were calculated based on the PDC results and were quantified by the defined regions of interest. Three groups were considered for this study, the control population, patients with focal epilepsy, and patients with generalized epilepsy. A significant difference in inflow and outflow validated by the nonparametric Kruskal-Wallis test was observed for these groups. By taking advantage of directionality of brain connectivity and by extracting the intensity of information flow, specific patterns in different brain regions of interest between each data group can be revealed. This is rather important as researchers could then associate such patterns in context to the 3D source localization where seizures are thought to emanate in focal epilepsy. This research endeavor, given its generalized construct, can extend for the study of other neurological and neurode- generative disorders such as Parkinson, depression, Alzheimers disease, and mental illness

Graph Signal Processing: Overview, Challenges and Applications

Research in Graph Signal Processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing. We then summarize recent developments in developing basic GSP tools, including methods for sampling, filtering or graph learning. Next, we review progress in several application areas using GSP, including processing and analysis of sensor network data, biological data, and applications to image processing and machine learning. We finish by providing a brief historical perspective to highlight how concepts recently developed in GSP build on top of prior research in other areas.Comment: To appear, Proceedings of the IEE

Clustering and Community Detection in Directed Networks: A Survey

Networks (or graphs) appear as dominant structures in diverse domains, including sociology, biology, neuroscience and computer science. In most of the aforementioned cases graphs are directed - in the sense that there is directionality on the edges, making the semantics of the edges non symmetric. An interesting feature that real networks present is the clustering or community structure property, under which the graph topology is organized into modules commonly called communities or clusters. The essence here is that nodes of the same community are highly similar while on the contrary, nodes across communities present low similarity. Revealing the underlying community structure of directed complex networks has become a crucial and interdisciplinary topic with a plethora of applications. Therefore, naturally there is a recent wealth of research production in the area of mining directed graphs - with clustering being the primary method and tool for community detection and evaluation. The goal of this paper is to offer an in-depth review of the methods presented so far for clustering directed networks along with the relevant necessary methodological background and also related applications. The survey commences by offering a concise review of the fundamental concepts and methodological base on which graph clustering algorithms capitalize on. Then we present the relevant work along two orthogonal classifications. The first one is mostly concerned with the methodological principles of the clustering algorithms, while the second one approaches the methods from the viewpoint regarding the properties of a good cluster in a directed network. Further, we present methods and metrics for evaluating graph clustering results, demonstrate interesting application domains and provide promising future research directions.Comment: 86 pages, 17 figures. Physics Reports Journal (To Appear