The thresholding problem and variability in the EEG graph network parameters.
Ontology highlight
ABSTRACT:
SUBMITTER: Adamovich T
PROVIDER: S-EPMC9636266 | biostudies-literature | 2022 Nov
REPOSITORIES: biostudies-literature
Publications
The thresholding problem and variability in the EEG graph network parameters.
Adamovich Timofey T Zakharov Ilya I Tabueva Anna A Malykh Sergey S
Scientific reports 20221104 1
Graph thresholding is a frequently used practice of eliminating the weak connections in brain functional connectivity graphs. The main aim of the procedure is to delete the spurious connections in the data. However, the choice of the threshold is arbitrary, and the effect of the threshold choice is not fully understood. Here we present the description of the changes in the global measures of a functional connectivity graph depending on the different proportional thresholds based on the 146 resti ...[more]
Similar Datasets
Project description:Graph theory deterministically models networks as sets of vertices, which are linked by connections. Such mathematical representation of networks, called graphs are increasingly used in neuroscience to model functional brain networks. It was shown that many forms of structural and functional brain networks have small-world characteristics, thus, constitute networks of dense local and highly effective distal information processing. Motivated by a previous small-world connectivity analysis of resting EEG-data we explored implications of a commonly used analysis approach. This common course of analysis is to compare small-world characteristics between two groups using classical inferential statistics. This however, becomes problematic when using measures of inter-subject correlations, as it is the case in commonly used brain imaging methods such as structural and diffusion tensor imaging with the exception of fibre tracking. Since for each voxel, or region there is only one data point, a measure of connectivity can only be computed for a group. To empirically determine an adequate small-world network threshold and to generate the necessary distribution of measures for classical inferential statistics, samples are generated by thresholding the networks on the group level over a range of thresholds. We believe that there are mainly two problems with this approach. First, the number of thresholded networks is arbitrary. Second, the obtained thresholded networks are not independent samples. Both issues become problematic when using commonly applied parametric statistical tests. Here, we demonstrate potential consequences of the number of thresholds and non-independency of samples in two examples (using artificial data and EEG data). Consequently alternative approaches are presented, which overcome these methodological issues.
| S-EPMC3536769 | biostudies-other
Project description:Given a directed graph G = (V, E), a feedback vertex set is a vertex subset C whose removal makes the graph G acyclic. The feedback vertex set problem is to find the subset C* whose cardinality is the minimum. As a general model, this problem has a variety of applications. However, the problem is known to be NP-hard, and thus computationally challenging. To solve this difficult problem, this article develops an iterated dynamic thresholding search algorithm, which features a combination of local optimization, dynamic thresholding search, and perturbation. Computational experiments on 101 benchmark graphs from various sources demonstrate the advantage of the algorithm compared with the state-of-the-art algorithms, by reporting record-breaking best solutions for 24 graphs, equally best results for 75 graphs, and worse best results for only two graphs. We also study how the key components of the algorithm affect its performance of the algorithm.
| S-EPMC10280643 | biostudies-literature
Project description:BackgroundAlthough a large body of knowledge about both brain structure and function has been gathered over the last decades, we still have a poor understanding of their exact relationship. Graph theory provides a method to study the relation between network structure and function, and its application to neuroscientific data is an emerging research field. We investigated topological changes in large-scale functional brain networks in patients with Alzheimer's disease (AD) and frontotemporal lobar degeneration (FTLD) by means of graph theoretical analysis of resting-state EEG recordings. EEGs of 20 patients with mild to moderate AD, 15 FTLD patients, and 23 non-demented individuals were recorded in an eyes-closed resting-state. The synchronization likelihood (SL), a measure of functional connectivity, was calculated for each sensor pair in 0.5-4 Hz, 4-8 Hz, 8-10 Hz, 10-13 Hz, 13-30 Hz and 30-45 Hz frequency bands. The resulting connectivity matrices were converted to unweighted graphs, whose structure was characterized with several measures: mean clustering coefficient (local connectivity), characteristic path length (global connectivity) and degree correlation (network 'assortativity'). All results were normalized for network size and compared with random control networks.ResultsIn AD, the clustering coefficient decreased in the lower alpha and beta bands (p < 0.001), and the characteristic path length decreased in the lower alpha and gamma bands (p < 0.05) compared to controls. In FTLD no significant differences with controls were found in these measures. The degree correlation decreased in both alpha bands in AD compared to controls (p < 0.05), but increased in the FTLD lower alpha band compared with controls (p < 0.01).ConclusionWith decreasing local and global connectivity parameters, the large-scale functional brain network organization in AD deviates from the optimal 'small-world' network structure towards a more 'random' type. This is associated with less efficient information exchange between brain areas, supporting the disconnection hypothesis of AD. Surprisingly, FTLD patients show changes in the opposite direction, towards a (perhaps excessively) more 'ordered' network structure, possibly reflecting a different underlying pathophysiological process.
| S-EPMC2736175 | biostudies-literature
Project description:The graph realization problem has received a great deal of attention in recent years, due to its importance in applications such as wireless sensor networks and structural biology. In this paper, we extend the previous work and propose the 3D-As-Synchronized-As-Possible (3D-ASAP) algorithm, for the graph realization problem in ?3, given a sparse and noisy set of distance measurements. 3D-ASAP is a divide and conquer, non-incremental and non-iterative algorithm, which integrates local distance information into a global structure determination. Our approach starts with identifying, for every node, a subgraph of its 1-hop neighborhood graph, which can be accurately embedded in its own coordinate system. In the noise-free case, the computed coordinates of the sensors in each patch must agree with their global positioning up to some unknown rigid motion, that is, up to translation, rotation and possibly reflection. In other words, to every patch, there corresponds an element of the Euclidean group, Euc(3), of rigid transformations in ?3, and the goal was to estimate the group elements that will properly align all the patches in a globally consistent way. Furthermore, 3D-ASAP successfully incorporates information specific to the molecule problem in structural biology, in particular information on known substructures and their orientation. In addition, we also propose 3D-spectral-partitioning (SP)-ASAP, a faster version of 3D-ASAP, which uses a spectral partitioning algorithm as a pre-processing step for dividing the initial graph into smaller subgraphs. Our extensive numerical simulations show that 3D-ASAP and 3D-SP-ASAP are very robust to high levels of noise in the measured distances and to sparse connectivity in the measurement graph, and compare favorably with similar state-of-the-art localization algorithms.
| S-EPMC3889082 | biostudies-literature
Project description:Dynamic complexity in brain functional connectivity has hindered the effective use of signal processing or machine learning methods to diagnose neurological disorders such as epilepsy. This paper proposed a new graph-generative neural network (GGN) model for the dynamic discovery of brain functional connectivity via deep analysis of scalp electroencephalogram (EEG) signals recorded from various regions of a patient's scalp. Brain functional connectivity graphs are generated for the extraction of spatial-temporal resolution of various onset epilepsy seizure patterns. Our supervised GGN model was substantiated by seizure detection and classification experiments. We train the GGN model using a clinically proven dataset of over 3047 epileptic seizure cases. The GGN model achieved a 91% accuracy in classifying seven types of epileptic seizure attacks, which outperformed the 65%, 74%, and 82% accuracy in using the convolutional neural network (CNN), graph neural networks (GNN), and transformer models, respectively. We present the GGN model architecture and operational steps to assist neuroscientists or brain specialists in using dynamic functional connectivity information to detect neurological disorders. Furthermore, we suggest to merge our spatial-temporal graph generator design in upgrading the conventional CNN and GNN models with dynamic convolutional kernels for accuracy enhancement.
| S-EPMC9643358 | biostudies-literature
Project description:The topological architecture of brain connectivity has been well-characterized by graph theory based analysis. However, previous studies have primarily built brain graphs based on a single modality of brain imaging data. Here we develop a framework to construct multi-modal brain graphs using concurrent EEG-fMRI data which are simultaneously collected during eyes open (EO) and eyes closed (EC) resting states. FMRI data are decomposed into independent components with associated time courses by group independent component analysis (ICA). EEG time series are segmented, and then spectral power time courses are computed and averaged within 5 frequency bands (delta; theta; alpha; beta; low gamma). EEG-fMRI brain graphs, with EEG electrodes and fMRI brain components serving as nodes, are built by computing correlations within and between fMRI ICA time courses and EEG spectral power time courses. Dynamic EEG-fMRI graphs are built using a sliding window method, versus static ones treating the entire time course as stationary. In global level, static graph measures and properties of dynamic graph measures are different across frequency bands and are mainly showing higher values in eyes closed than eyes open. Nodal level graph measures of a few brain components are also showing higher values during eyes closed in specific frequency bands. Overall, these findings incorporate fMRI spatial localization and EEG frequency information which could not be obtained by examining only one modality. This work provides a new approach to examine EEG-fMRI associations within a graph theoretic framework with potential application to many topics.
| S-EPMC5039193 | biostudies-literature
Project description:BackgroundCognitive insight phenomenon lies at the core of numerous discoveries. Behavioral research indicates four salient features of insightful problem solving: (i) mental impasse, followed by (ii) restructuring of the problem representation, which leads to (iii) a deeper understanding of the problem, and finally culminates in (iv) an "Aha!" feeling of suddenness and obviousness of the solution. However, until now no efforts have been made to investigate the neural mechanisms of these constituent features of insight in a unified framework.Methodology/principal findingsIn an electroencephalographic study using verbal remote associate problems, we identified neural correlates of these four features of insightful problem solving. Hints were provided for unsolved problems or after mental impasse. Subjective ratings of the restructuring process and the feeling of suddenness were obtained on trial-by-trial basis. A negative correlation was found between these two ratings indicating that sudden insightful solutions, where restructuring is a key feature, involve automatic, subconscious recombination of information. Electroencephalogram signals were analyzed in the space x time x frequency domain with a nonparametric cluster randomization test. First, we found strong gamma band responses at parieto-occipital regions which we interpreted as (i) an adjustment of selective attention (leading to a mental impasse or to a correct solution depending on the gamma band power level) and (ii) encoding and retrieval processes for the emergence of spontaneous new solutions. Secondly, we observed an increased upper alpha band response in right temporal regions (suggesting active suppression of weakly activated solution relevant information) for initially unsuccessful trials that after hint presentation led to a correct solution. Finally, for trials with high restructuring, decreased alpha power (suggesting greater cortical excitation) was observed in right prefrontal area.Conclusions/significanceOur results provide a first account of cognitive insight by dissociating its constituent components and potential neural correlates.
| S-EPMC2180197 | biostudies-literature
Project description:Neural circuits use homeostatic compensation to achieve consistent behavior despite variability in underlying intrinsic and network parameters. However, it remains unclear how compensation regulates variability across a population of the same type of neurons within an individual and what computational benefits might result from such compensation. We address these questions in the Drosophila mushroom body, the fly's olfactory memory center. In a computational model, we show that under sparse coding conditions, memory performance is degraded when the mushroom body's principal neurons, Kenyon cells (KCs), vary realistically in key parameters governing their excitability. However, memory performance is rescued while maintaining realistic variability if parameters compensate for each other to equalize KC average activity. Such compensation can be achieved through both activity-dependent and activity-independent mechanisms. Finally, we show that correlations predicted by our model's compensatory mechanisms appear in the Drosophila hemibrain connectome. These findings reveal compensatory variability in the mushroom body and describe its computational benefits for associative memory.
| S-EPMC8670477 | biostudies-literature
Project description:Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-based solvers require a combination of annealing and classical pre- and post-processing; at this early stage, little is known about how to partition and optimize the processing. This article presents an experimental case study of quantum annealing and some of the factors involved in real-world solvers, using a 504-qubit D-Wave Two machine and the graph isomorphism problem. To illustrate the role of classical pre-processing, a compact Hamiltonian is presented that enables a reduced Ising model for each problem instance. On random N-vertex graphs, the median number of variables is reduced from N(2) to fewer than N log2 N and solvable graph sizes increase from N = 5 to N = 13. Additionally, error correction via classical post-processing majority voting is evaluated. While the solution times are not competitive with classical approaches to graph isomorphism, the enhanced solver ultimately classified correctly every problem that was mapped to the processor and demonstrated clear advantages over the baseline approach. The results shed some light on the nature of real-world quantum annealing and the associated hybrid classical-quantum solvers.
| S-EPMC4459189 | biostudies-other
Project description:Epilepsy is a chronic brain disease that causes persistent and severe damage to the physical and mental health of patients. Daily effective prediction of epileptic seizures is crucial for epilepsy patients especially those with refractory epilepsy. At present, a large number of deep learning algorithms such as Convolutional Neural Networks and Recurrent Neural Networks have been used to predict epileptic seizures and have obtained better performance than traditional machine learning methods. However, these methods usually transform the Electroencephalogram (EEG) signal into a Euclidean grid structure. The conversion suffers from loss of adjacent spatial information, which results in deep learning models requiring more storage and computational consumption in the process of information fusion after information extraction. This study proposes a general Graph Convolutional Networks (GCN) model architecture for predicting seizures to solve the problem of oversized seizure prediction models based on exploring the graph structure of EEG signals. As a graph classification task, the network architecture includes graph convolution layers that extract node features with one-hop neighbors, pooling layers that summarize abstract node features; and fully connected layers that implement classification, resulting in superior prediction performance and smaller network size. The experiment shows that the model has an average sensitivity of 96.51%, an average AUC of 0.92, and a model size of 15.5 k on 18 patients in the CHB-MIT scalp EEG dataset. Compared with traditional deep learning methods, which require a large number of parameters and computational effort and are demanding in terms of storage space and energy consumption, this method is more suitable for implementation on compact, low-power wearable devices as a standard process for building a generic low-consumption graph network model on similar biomedical signals. Furthermore, the edge features of graphs can be used to make a preliminary determination of locations and types of discharge, making it more clinically interpretable.
| S-EPMC9376592 | biostudies-literature