Principled approach to the selection of the embedding dimension of networks.
Ontology highlight
ABSTRACT:
SUBMITTER: Gu W
PROVIDER: S-EPMC8213704 | biostudies-literature |
REPOSITORIES: biostudies-literature
Similar Datasets
Project description:The identification of condition-specific gene sets from transcriptomic experiments is important to reveal regulatory and signaling mechanisms associated with a given cellular response. Statistical methods of differential expression analysis, designed to assess individual gene variations, have trouble highlighting modules of small varying genes whose interaction is essential to characterize phenotypic changes. To identify these highly informative gene modules, several methods have been proposed in recent years, but they have many limitations that make them of little use to biologists. Here, we propose an efficient method for identifying these active modules that operates on a data embedding combining gene expressions and interaction data. Applications carried out on real datasets show that our method can identify new groups of genes of high interest corresponding to functions not revealed by traditional approaches. Software is available at https://github.com/claudepasquier/amine.
| S-EPMC10282331 | biostudies-literature
Project description:Background: Neuronal activity can be modeled as a nonlinear dynamical system to yield novel measures of neuronal state and dysfunction. We hypothesized that electrical activity during neuronal differentiation would be marked by a reduction in dynamical complexity in autism spectrum disorder (ASD). Methods: Electrical activity of induced pluripotent stem cell (iPSC)-derived neurons from ASD patients and controls were recorded using a multielectrode array (MEA). Minimum embedding dimension (MED) analysis was performed to characterize the complexity present in the electrical recordings of the neuronal cultures during differentiation. Gene expression changes with respect to the MED were analyzed, and gene ontology analysis and the BrainSpan Atlas were used to identify gene enrichments in specific biological pathways, brain regions, and developmental stages. Results: We found that the MED showed a statistically significant deficit in the ASD samples, suggesting that, compared to controls, network complexity is reduced in ASD during neuronal differentiation. MED was correlated to clinical endpoints such as nonverbal intelligence and was associated with 53 differentially expressed genes. These differentially expressed genes were overrepresented in ASD gene lists and pathways related to neurodevelopment, cell morphology, and cell migration. Spatiotemporal analysis also showed a prenatal temporal enrichment in cortical and deep brain structures. Conclusion: Reduced network complexity in ASD was observed by MED analysis during neuronal differentiation, indicating deficits in integrated and synchronized firing. The results present nonlinear dynamical analysis of iPSC-derived neuronal electrical recordings as a new paradigm for the investigation of aberrant brain activity in neurodevelopmental disorders.
2020-05-18 | GSE125020 | GEO
Project description:Decoders optimized offline to reconstruct intended movements from neural recordings sometimes fail to achieve optimal performance online when they are used in closed-loop as part of an intracortical brain-computer interface (iBCI). This is because typical decoder calibration routines do not model the emergent interactions between the decoder, the user, and the task parameters (e.g. target size). Here, we investigated the feasibility of simulating online performance to better guide decoder parameter selection and design. Three participants in the BrainGate2 pilot clinical trial controlled a computer cursor using a linear velocity decoder under different gain (speed scaling) and temporal smoothing parameters and acquired targets with different radii and distances. We show that a user-specific iBCI feedback control model can predict how performance changes under these different decoder and task parameters in held-out data. We also used the model to optimize a nonlinear speed scaling function for the decoder. When used online with two participants, it increased the dynamic range of decoded speeds and decreased the time taken to acquire targets (compared to an optimized standard decoder). These results suggest that it is feasible to simulate iBCI performance accurately enough to be useful for quantitative decoder optimization and design.
| S-EPMC6586941 | biostudies-literature
Project description:Conventional dimensionality reduction methods like Multidimensional Scaling (MDS) are sensitive to the presence of orthogonal outliers, leading to significant defects in the embedding. We introduce a robust MDS method, called DeCOr-MDS (Detection and Correction of Orthogonal outliers using MDS), based on the geometry and statistics of simplices formed by data points, that allows to detect orthogonal outliers and subsequently reduce dimensionality. We validate our methods using synthetic datasets, and further show how it can be applied to a variety of large real biological datasets, including cancer image cell data, human microbiome project data and single cell RNA sequencing data, to address the task of data cleaning and visualization.
| S-EPMC10448701 | biostudies-literature
Project description:Biological phenotypes are products of complex evolutionary processes in which selective forces influence multiple biological trait measurements in unknown ways. Phylogenetic comparative methods seek to disentangle these relationships across the evolutionary history of a group of organisms. Unfortunately, most existing methods fail to accommodate high-dimensional data with dozens or even thousands of observations per taxon. Phylogenetic factor analysis offers a solution to the challenge of dimensionality. However, scientists seeking to employ this modeling framework confront numerous modeling and implementation decisions, the details of which pose computational and replicability challenges.We develop new inference techniques that increase both the computational efficiency and modeling flexibility of phylogenetic factor analysis. To facilitate adoption of these new methods, we present a practical analysis plan that guides researchers through the web of complex modeling decisions. We codify this analysis plan in an automated pipeline that distills the potentially overwhelming array of decisions into a small handful of (typically binary) choices.We demonstrate the utility of these methods and analysis plan in four real-world problems of varying scales. Specifically, we study floral phenotype and pollination in columbines, domestication in industrial yeast, life history in mammals, and brain morphology in New World monkeys.General and impactful community employment of these methods requires a data scientific analysis plan that balances flexibility, speed and ease of use, while minimizing model and algorithm tuning. Even in the presence of non-trivial phylogenetic model constraints, we show that one may analytically address latent factor uncertainty in a way that (a) aids model flexibility, (b) accelerates computation (by as much as 500-fold) and (c) decreases required tuning. These efforts coalesce to create an accessible Bayesian approach to high-dimensional phylogenetic comparative methods on large trees.
| S-EPMC9997680 | biostudies-literature
Project description:Network embedding techniques are powerful to capture structural regularities in networks and to identify similarities between their local fabrics. However, conventional network embedding models are developed for static structures, commonly consider nodes only and they are seriously challenged when the network is varying in time. Temporal networks may provide an advantage in the description of real systems, but they code more complex information, which could be effectively represented only by a handful of methods so far. Here, we propose a new method of event embedding of temporal networks, called weg2vec, which builds on temporal and structural similarities of events to learn a low dimensional representation of a temporal network. This projection successfully captures latent structures and similarities between events involving different nodes at different times and provides ways to predict the final outcome of spreading processes unfolding on the temporal structure.
| S-EPMC7189270 | biostudies-literature
Project description:The network embedding task is to represent a node in a network as a low-dimensional vector while incorporating the topological and structural information. Most existing approaches solve this problem by factorizing a proximity matrix, either directly or implicitly. In this work, we introduce a network embedding method from a new perspective, which leverages Modern Hopfield Networks (MHN) for associative learning. Our network learns associations between the content of each node and that node's neighbors. These associations serve as memories in the MHN. The recurrent dynamics of the network make it possible to recover the masked node, given that node's neighbors. Our proposed method is evaluated on different benchmark datasets for downstream tasks such as node classification, link prediction, and graph coarsening. The results show competitive performance compared to the common matrix factorization techniques and deep learning based methods.
| S-EPMC9713410 | biostudies-literature
Project description:We provide a novel and completely different approach to dimension-reduction problems from the existing literature. We cast the dimension-reduction problem in a semiparametric estimation framework and derive estimating equations. Viewing this problem from the new angle allows us to derive a rich class of estimators, and obtain the classical dimension reduction techniques as special cases in this class. The semiparametric approach also reveals that in the inverse regression context while keeping the estimation structure intact, the common assumption of linearity and/or constant variance on the covariates can be removed at the cost of performing additional nonparametric regression. The semiparametric estimators without these common assumptions are illustrated through simulation studies and a real data example. This article has online supplementary material.
| S-EPMC3698620 | biostudies-literature
Project description:We present a new heuristic feature-selection (FS) algorithm that integrates in a principled algorithmic framework the three key FS components: relevance, redundancy, and complementarity. Thus, we call it relevance, redundancy, and complementarity trade-off (RRCT). The association strength between each feature and the response and between feature pairs is quantified via an information theoretic transformation of rank correlation coefficients, and the feature complementarity is quantified using partial correlation coefficients. We empirically benchmark the performance of RRCT against 19 FS algorithms across four synthetic and eight real-world datasets in indicative challenging settings evaluating the following: (1) matching the true feature set and (2) out-of-sample performance in binary and multi-class classification problems when presenting selected features into a random forest. RRCT is very competitive in both tasks, and we tentatively make suggestions on the generalizability and application of the best-performing FS algorithms across settings where they may operate effectively.
| S-EPMC9122960 | biostudies-literature
Project description:Complex networked systems ranging from ecosystems and the climate to economic, social, and infrastructure systems can exhibit a tipping point (a "point of no return") at which a total collapse of the system occurs. To understand the dynamical mechanism of a tipping point and to predict its occurrence as a system parameter varies are of uttermost importance, tasks that are hindered by the often extremely high dimensionality of the underlying system. Using complex mutualistic networks in ecology as a prototype class of systems, we carry out a dimension reduction process to arrive at an effective 2D system with the two dynamical variables corresponding to the average pollinator and plant abundances. We show, using 59 empirical mutualistic networks extracted from real data, that our 2D model can accurately predict the occurrence of a tipping point, even in the presence of stochastic disturbances. We also find that, because of the lack of sufficient randomness in the structure of the real networks, weighted averaging is necessary in the dimension reduction process. Our reduced model can serve as a paradigm for understanding and predicting the tipping point dynamics in real world mutualistic networks for safeguarding pollinators, and the general principle can be extended to a broad range of disciplines to address the issues of resilience and sustainability.
| S-EPMC5789925 | biostudies-literature