Dataset Information

Markov Model-Based Method to Analyse Time-Varying Networks in EEG Task-Related Data.

ABSTRACT: The dynamic nature of functional brain networks is being increasingly recognized in cognitive neuroscience, and methods to analyse such time-varying networks in EEG/MEG data are required. In this work, we propose a pipeline to characterize time-varying networks in single-subject EEG task-related data and further, evaluate its validity on both simulated and experimental datasets. Pre-processing is done to remove channel-wise and trial-wise differences in activity. Functional networks are estimated from short non-overlapping time windows within each "trial," using a sparse-MVAR (Multi-Variate Auto-Regressive) model. Functional "states" are then identified by partitioning the entire space of functional networks into a small number of groups/symbols via k-means clustering.The multi-trial sequence of symbols is then described by a Markov Model (MM). We show validity of this pipeline on realistic electrode-level simulated EEG data, by demonstrating its ability to discriminate "trials" from two experimental conditions in a range of scenarios. We then apply it to experimental data from two individuals using a Brain-Computer Interface (BCI) via a P300 oddball task. Using just the Markov Model parameters, we obtain statistically significant discrimination between target and non-target trials. The functional networks characterizing each 'state' were also highly similar between the two individuals. This work marks the first application of the Markov Model framework to infer time-varying networks from EEG/MEG data. Due to the pre-processing, results from the pipeline are orthogonal to those from conventional ERP averaging or a typical EEG microstate analysis. The results provide powerful proof-of-concept for a Markov model-based approach to analyzing the data, paving the way for its use to track rapid changes in interaction patterns as a task is being performed. MATLAB code for the entire pipeline has been made available.

SUBMITTER: Williams NJ

PROVIDER: S-EPMC6160873 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Markov Model-Based Method to Analyse Time-Varying Networks in EEG Task-Related Data.

Williams Nitin J NJ Daly Ian I Nasuto Slawomir J SJ

Frontiers in computational neuroscience 20180921

The dynamic nature of functional brain networks is being increasingly recognized in cognitive neuroscience, and methods to analyse such time-varying networks in EEG/MEG data are required. In this work, we propose a pipeline to characterize time-varying networks in single-subject EEG task-related data and further, evaluate its validity on both simulated and experimental datasets. Pre-processing is done to remove channel-wise and trial-wise differences in activity. Functional networks are estimate ...[more]

PMID: 30297993

Similar Datasets

Project description:IntroductionElectroencephalogram (EEG) acquisition is easily affected by various noises, including those from electrocardiogram (ECG), electrooculogram (EOG), and electromyogram (EMG). Because noise interference can significantly limit the study and analysis of brain signals, there is a significant need for the development of improved methods to remove this interference for more accurate measurement of EEG signals.MethodsBased on the non-linear and non-stationary characteristics of brain signals, a strategy was developed to denoise brain signals using a time-frequency denoising algorithm framework of short-time Fourier transform (STFT), bidimensional empirical mode decomposition (BEMD), and non-local means (NLM). Time-frequency analysis can reveal the signal frequency component and its evolution process, allowing the elimination of noise according to the signal and noise distribution. BEMD can be used to decompose the time-frequency signals into sub-time-frequency signals for noise removal at different scales. NLM relies on structural self-similarity to locally smooth an image to remove noise and restore its main geometric structure, making this method appropriate for time-frequency signal denoising.ResultsThe experimental results show that the proposed method can effectively suppress the high-frequency components of brain signals, resulting in a smoother brain signal waveform after denoising. The correlation coefficient of the reference signal, a superposition average of multiple trial signals, and the original single trial signal was determined, and then correlation coefficients were calculated between the reference signal and single trial signals processed by time-frequency denoising, ensemble empirical mode decomposition (EEMD)-independent component analysis (ICA), EEMD-canonical correlation analysis (CCA), and wavelet threshold denoising methods. The correlation coefficient was highest for the signal processed by the time-frequency denoising method and the reference signal, indicating that the single trial signal after time-frequency denoising was most similar to the waveform of the reference signal and suggesting this is a feasible strategy to effectively reduce noise and more accurately determine signals.DiscussionThe proposed time-frequency denoising method exhibits excellent performance with promising potential for practical application.

Project description:Temporal analysis of genome-wide data can provide insights into the underlying mechanism of the biological processes in two ways. First, grouping the temporal data provides a richer, more robust representation of the underlying processes that are co-regulated. The net result is a significant dimensional reduction of the genome-wide array data into a smaller set of vocabularies for bioinformatics analysis. Second, the computed set of time-course vocabularies can be interrogated for a potential causal network that can shed light on the underlying interactions. The method is coupled with an experiment for investigating responses to high doses of ionizing radiation with and without a small priming dose. From a computational perspective, inference of a causal network can rapidly become computationally intractable with the increasing number of variables. Additionally, from a bioinformatics perspective, larger networks always hinder interpretation. Therefore, our method focuses on inferring the simplest network that is computationally tractable and interpretable. The method first reduces the number of temporal variables through consensus clustering to reveal a small set of temporal templates. It then enforces simplicity in the network configuration through the sparsity constraint, which is further regularized by requiring continuity between consecutive time points. We present intermediate results for each computational step, and apply our method to a time-course transcriptome dataset for a cell line receiving a challenge dose of ionizing radiation with and without a prior priming dose. Our analyses indicate that (i) the priming dose increases the diversity of the computed templates (e.g., diversity of transcriptome signatures); thus, increasing the network complexity; (ii) as a result of the priming dose, there are a number of unique templates with delayed and oscillatory profiles; and (iii) radiation-induced stress responses are enriched through pathway and subnetwork studies.

Dataset Information

Markov Model-Based Method to Analyse Time-Varying Networks in EEG Task-Related Data.

Publications

Markov Model-Based Method to Analyse Time-Varying Networks in EEG Task-Related Data.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets