SEED-G: Simulated EEG Data Generator for Testing Connectivity Algorithms.
Ontology highlight
ABSTRACT:
SUBMITTER: Anzolin A
PROVIDER: S-EPMC8197139 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:Human brain function depends on directed interactions between multiple areas that evolve in the subsecond range. Time-varying multivariate autoregressive (tvMVAR) modeling has been proposed as a way to help quantify directed functional connectivity strengths with high temporal resolution. While several tvMVAR approaches are currently available, there is a lack of unbiased systematic comparative analyses of their performance and of their sensitivity to parameter choices. Here, we critically compare four recursive tvMVAR algorithms and assess their performance while systematically varying adaptation coefficients, model order, and signal sampling rate. We also compared two ways of exploiting repeated observations: single-trial modeling followed by averaging, and multi-trial modeling where one tvMVAR model is fitted across all trials. Results from numerical simulations and from benchmark EEG recordings showed that: i) across a broad range of model orders all algorithms correctly reproduced patterns of interactions; ii) signal downsampling degraded connectivity estimation accuracy for most algorithms, although in some cases downsampling was shown to reduce variability in the estimates by lowering the number of parameters in the model; iii) single-trial modeling followed by averaging showed optimal performance with larger adaptation coefficients than previously suggested, and showed slower adaptation speeds than multi-trial modeling. Overall, our findings identify strengths and weaknesses of existing tvMVAR approaches and provide practical recommendations for their application to modeling dynamic directed interactions from electrophysiological signals.
| S-EPMC5995381 | biostudies-literature
Project description:BACKGROUND: In recent years, several authors have used probabilistic graphical models to learn expression modules and their regulatory programs from gene expression data. Despite the demonstrated success of such algorithms in uncovering biologically relevant regulatory relations, further developments in the area are hampered by a lack of tools to compare the performance of alternative module network learning strategies. Here, we demonstrate the use of the synthetic data generator SynTReN for the purpose of testing and comparing module network learning algorithms. We introduce a software package for learning module networks, called LeMoNe, which incorporates a novel strategy for learning regulatory programs. Novelties include the use of a bottom-up Bayesian hierarchical clustering to construct the regulatory programs, and the use of a conditional entropy measure to assign regulators to the regulation program nodes. Using SynTReN data, we test the performance of LeMoNe in a completely controlled situation and assess the effect of the methodological changes we made with respect to an existing software package, namely Genomica. Additionally, we assess the effect of various parameters, such as the size of the data set and the amount of noise, on the inference performance. RESULTS: Overall, application of Genomica and LeMoNe to simulated data sets gave comparable results. However, LeMoNe offers some advantages, one of them being that the learning process is considerably faster for larger data sets. Additionally, we show that the location of the regulators in the LeMoNe regulation programs and their conditional entropy may be used to prioritize regulators for functional validation, and that the combination of the bottom-up clustering strategy with the conditional entropy-based assignment of regulators improves the handling of missing or hidden regulators. CONCLUSION: We show that data simulators such as SynTReN are very well suited for the purpose of developing, testing and improving module network algorithms. We used SynTReN data to develop and test an alternative module network learning strategy, which is incorporated in the software package LeMoNe, and we provide evidence that this alternative strategy has several advantages with respect to existing methods.
| S-EPMC1892074 | biostudies-literature
Project description:Electroencephalography (EEG) is the standard diagnosis method for a wide variety of diseases such as epilepsy, sleep disorders, encephalopathies, and coma, among others. Resting-state functional magnetic resonance (rs-fMRI) is currently a technique used in research in both healthy individuals as well as patients. EEG and fMRI are procedures used to obtain direct and indirect measurements of brain neural activity: EEG measures the electrical activity of the brain using electrodes placed on the scalp, and fMRI detects the changes in blood oxygenation that occur in response to neural activity. EEG has a high temporal resolution and low spatial resolution, while fMRI has high spatial resolution and low temporal resolution. Thus, the combination of EEG with rs-fMRI using different methods could be very useful for research and clinical applications. In this article, we describe and show the results of a new methodology for processing rs-fMRI using seeds positioned according to the 10-10 EEG standard. We analyze the functional connectivity and adjacency matrices obtained using 65 seeds based on 10-10 EEG scheme and 21 seeds based on 10-20 EEG. Connectivity networks are created using each 10-20 EEG seeds and are analyzed by comparisons to the seven networks that have been found in recent studies. The proposed method captures high correlation between contralateral seeds, ipsilateral and contralateral occipital seeds, and some in the frontal lobe.
| S-EPMC5928390 | biostudies-literature
Project description:BackgroundThe development of algorithms to infer the structure of gene regulatory networks based on expression data is an important subject in bioinformatics research. Validation of these algorithms requires benchmark data sets for which the underlying network is known. Since experimental data sets of the appropriate size and design are usually not available, there is a clear need to generate well-characterized synthetic data sets that allow thorough testing of learning algorithms in a fast and reproducible manner.ResultsIn this paper we describe a network generator that creates synthetic transcriptional regulatory networks and produces simulated gene expression data that approximates experimental data. Network topologies are generated by selecting subnetworks from previously described regulatory networks. Interaction kinetics are modeled by equations based on Michaelis-Menten and Hill kinetics. Our results show that the statistical properties of these topologies more closely approximate those of genuine biological networks than do those of different types of random graph models. Several user-definable parameters adjust the complexity of the resulting data set with respect to the structure learning algorithms.ConclusionThis network generation technique offers a valid alternative to existing methods. The topological characteristics of the generated networks more closely resemble the characteristics of real transcriptional networks. Simulation of the network scales well to large networks. The generator models different types of biological interactions and produces biologically plausible synthetic gene expression data.
| S-EPMC1373604 | biostudies-literature
Project description:Spatial leakage effects are particularly confounding for seed-based investigations of brain networks using source-level electroencephalography (EEG) or magnetoencephalography (MEG). Various methods designed to avoid this issue have been introduced but are limited to particular assumptions about its temporal characteristics. Here, we investigate the usefulness of a model-based geometric correction scheme (GCS) to suppress spatial leakage emanating from the seed location. We analyze its properties theoretically and then assess potential advantages and limitations with simulated and experimental MEG data (resting state and auditory-motor task). To do so, we apply Minimum Norm Estimation (MNE) for source reconstruction and use variation of error parameters, statistical gauging of spatial leakage correction and comparison with signal orthogonalization. Results show that the GCS has a local (i.e., near the seed) effect only, in line with the geometry of MNE spatial leakage, and is able to map spatially all types of brain interactions, including linear correlations eliminated after signal orthogonalization. Furthermore, it is robust against the introduction of forward model errors. On the other hand, the GCS can be affected by local overcorrection effects and seed mislocation. These issues arise with signal orthogonalization too, although significantly less extensively, so the two approaches complement each other. The GCS thus appears to be a valuable addition to the spatial leakage correction toolkits for seed-based FC analyses in source-projected MEG/EEG data.
| S-EPMC6869295 | biostudies-literature
Project description:Recently, resting-state functional magnetic resonance imaging has been used to parcellate the brain into functionally distinct regions based on the information available in functional connectivity maps. However, brain voxels are not independent units and adjacent voxels are always highly correlated, so functional connectivity maps contain redundant information, which not only impairs the computational efficiency during clustering, but also reduces the accuracy of clustering results. The aim of this study was to propose feature-reduction approaches to reduce the redundancy and to develop semi-simulated data with defined ground truth to evaluate these approaches. We proposed a feature-reduction approach based on the Affinity Propagation Algorithm (APA) and compared it with the classic featurereduction approach based on Principal Component Analysis (PCA). We tested the two approaches to the parcellation of both semi-simulated and real seed regions using the K-means algorithm and designed two experiments to evaluate their noiseresistance. We found that all functional connectivity maps (with/without feature reduction) provided correct information for the parcellation of the semisimulated seed region and the computational efficiency was greatly improved by both featurereduction approaches. Meanwhile, the APA-based feature-reduction approach outperformed the PCAbased approach in noise-resistance. The results suggested that functional connectivity maps can provide correct information for cortical parcellation, and feature-reduction does not significantly change the information. Considering the improvement in computational efficiency and the noise-resistance, feature-reduction of functional connectivity maps before cortical parcellation is both feasible and necessary.
| S-EPMC5561846 | biostudies-other
Project description:This article provides a new tool for examining the efficiency and robustness of derivative-free optimization algorithms based on high-dimensional normalized data profiles that test a variety of performance metrics. Unlike the traditional data profiles that examine a single dimension, the proposed data profiles require several dimensions in order to analyze the relative performance of different optimization solutions. To design a use case, we utilize five sequences (solvers) of trigonometric simplex designs that extract different features of non-isometric reflections, as an example to show how various metrics (dimensions) are essential to provide a comprehensive evaluation about a particular solver relative to others. In addition, each designed sequence can rotate the starting simplex through an angle to designate the direction of the simplex. This type of features extraction is applied to each sequence of the triangular simplexes to determine a global minimum for a mathematical problem. To allocate an optimal sequence of trigonometric simplex designs, a linear model is used with the proposed data profiles to examine the convergence rate of the five simplexes. Furthermore, we compare the proposed five simplexes to an optimized version of the Nelder-Mead algorithm known as the Genetic Nelder-Mead algorithm. The experimental results demonstrate that the proposed data profiles lead to a better examination of the reliability and robustness for the considered solvers from a more comprehensive perspective than the existing data profiles. Finally, the high-dimensional data profiles reveal that the proposed solvers outperform the genetic solvers for all accuracy tests.
| S-EPMC9454945 | biostudies-literature
Project description:IntroductionMajor depressive disorder (MDD) is the most common mental disorder worldwide, leading to impairment in quality and independence of life. Electroencephalography (EEG) biomarkers processed with machine learning (ML) algorithms have been explored for objective diagnoses with promising results. However, the generalizability of those models, a prerequisite for clinical application, is restricted by small datasets. One approach to train ML models with good generalizability is complementing the original with synthetic data produced by generative algorithms. Another advantage of synthetic data is the possibility of publishing the data for other researchers without risking patient data privacy. Synthetic EEG time-series have not yet been generated for two clinical populations like MDD patients and healthy controls.MethodsWe first reviewed 27 studies presenting EEG data augmentation with generative algorithms for classification tasks, like diagnosis, for the possibilities and shortcomings of recent methods. The subsequent empirical study generated EEG time-series based on two public datasets with 30/28 and 24/29 subjects (MDD/controls). To obtain baseline diagnostic accuracies, convolutional neural networks (CNN) were trained with time-series from each dataset. The data were synthesized with generative adversarial networks (GAN) consisting of CNNs. We evaluated the synthetic data qualitatively and quantitatively and finally used it for re-training the diagnostic model.ResultsThe reviewed studies improved their classification accuracies by between 1 and 40% with the synthetic data. Our own diagnostic accuracy improved up to 10% for one dataset but not significantly for the other. We found a rich repertoire of generative models in the reviewed literature, solving various technical issues. A major shortcoming in the field is the lack of meaningful evaluation metrics for synthetic data. The few studies analyzing the data in the frequency domain, including our own, show that only some features can be produced truthfully.DiscussionThe systematic review combined with our own investigation provides an overview of the available methods for generating EEG data for a classification task, their possibilities, and shortcomings. The approach is promising and the technical basis is set. For a broad application of these techniques in neuroscience research or clinical application, the methods need fine-tuning facilitated by domain expertise in (clinical) EEG research.
| S-EPMC10577178 | biostudies-literature
Project description:In this paper, we present an extensive performance evaluation of a novel source localization algorithm, Champagne. It is derived in an empirical Bayesian framework that yields sparse solutions to the inverse problem. It is robust to correlated sources and learns the statistics of non-stimulus-evoked activity to suppress the effect of noise and interfering brain activity. We tested Champagne on both simulated and real M/EEG data. The source locations used for the simulated data were chosen to test the performance on challenging source configurations. In simulations, we found that Champagne outperforms the benchmark algorithms in terms of both the accuracy of the source localizations and the correct estimation of source time courses. We also demonstrate that Champagne is more robust to correlated brain activity present in real MEG data and is able to resolve many distinct and functionally relevant brain areas with real MEG and EEG data.
| S-EPMC4096349 | biostudies-literature
Project description:The construction of industrial projects involves fabricating and installing massive quantities of pipelines. The design data of pipelines is complex, usually unique for each project and not easily available to researchers and the public for confidentiality reasons. As a result, an industrial pipelines data generator able to realistically simulate pipelines structures will lessen the dependence on real-life data. This article describes an industrial pipelines data generator that was developed using topological and physical properties of pipelines from real industrial projects. This generator can simulate the properties (the type of component, length, diameter, running direction, and the connectivity relationships between components) of real industrial pipelines. Its application in construction engineering and management research, more specifically in the experimental analysis of an optimization algorithm, was described by the authors in previous work [1]. The data generator can be used to develop benchmark problem instances for optimization problems and for simulation studies of construction operations in industrial projects.
| S-EPMC7490719 | biostudies-literature