Tree preserving embedding.
Ontology highlight
ABSTRACT:
SUBMITTER: Shieh AD
PROVIDER: S-EPMC3193256 | biostudies-literature | 2011 Oct
REPOSITORIES: biostudies-literature
Publications
Tree preserving embedding.
Shieh Albert D AD Hashimoto Tatsunori B TB Airoldi Edoardo M EM
Proceedings of the National Academy of Sciences of the United States of America 20110926 41
The goal of dimensionality reduction is to embed high-dimensional data in a low-dimensional space while preserving structure in the data relevant to exploratory data analysis such as clusters. However, existing dimensionality reduction methods often either fail to separate clusters due to the crowding problem or can only separate clusters at a single resolution. We develop a new approach to dimensionality reduction: tree preserving embedding. Our approach uses the topological notion of connected ...[more]
Similar Datasets
Project description:Graph embedding methods are useful for a wide range of graph analysis tasks including link prediction and node classification. Most graph embedding methods learn only the topological structure of graphs. Nevertheless, it has been shown that the incorporation of node attributes is beneficial in improving the expressive power of node embeddings. However, real-world graphs are often noisy in terms of structure and/or attributes (missing and/or erroneous edges/attributes). Most existing graph embedding methods are susceptible to this noise, as they do not consider uncertainty during the modelling process. In this paper, we introduce RASE, a Robust Attribute and Structure preserving graph Embedding model. RASE is a novel graph representation learning model which effectively preserves both graph structure and node attributes through a unified loss function. To be robust, RASE uses a denoising attribute auto-encoder to deal with node attribute noise, and models uncertainty in the embedding space as Gaussians to cope with graph structure noise. We evaluate the performance of RASE through an extensive experimental study on various real-world datasets. Results demonstrate that RASE outperforms state-of-the-art embedding methods on multiple graph analysis tasks and is robust to both structure and attribute noise.
| S-EPMC7206273 | biostudies-literature
Project description:Brain development is a dynamic process with tissue-specific alterations that reflect complex and ongoing biological processes taking place during childhood and adolescence. Accurate identification and modelling of these anatomical processes in vivo with MRI may provide clinically useful imaging markers of individual variability in development. In this study, we use manifold learning to build a model of age- and sex-related anatomical variation using multiple magnetic resonance imaging metrics. Using publicly available data from a large paediatric cohort (n?=?768), we apply a multi-metric machine learning approach combining measures of tissue volume, cortical area and cortical thickness into a low-dimensional data representation. We find that neuroanatomical variation due to age and sex can be captured by two orthogonal patterns of brain development and we use this model to simultaneously predict age with a mean error of 1.5-1.6 years and sex with an accuracy of 81%. We validate this model in an independent developmental cohort. We present a framework for modelling anatomical development during childhood using manifold embedding. This model accurately predicts age and sex based on image-derived markers of cerebral morphology and generalises well to independent populations.
| S-EPMC5736651 | biostudies-literature
Project description:MicroRNAs (miRNAs) are a category of small non-coding RNAs that profoundly impact various biological processes related to human disease. Inferring the potential miRNA-disease associations benefits the study of human diseases, such as disease prevention, disease diagnosis, and drug development. In this work, we propose a novel heterogeneous network embedding-based method called MDN-NMTF (Module-based Dynamic Neighborhood Non-negative Matrix Tri-Factorization) for predicting miRNA-disease associations. MDN-NMTF constructs a heterogeneous network of disease similarity network, miRNA similarity network and a known miRNA-disease association network. After that, it learns the latent vector representation for miRNAs and diseases in the heterogeneous network. Finally, the association probability is computed by the product of the latent miRNA and disease vectors. MDN-NMTF not only successfully integrates diverse biological information of miRNAs and diseases to predict miRNA-disease associations, but also considers the module properties of miRNAs and diseases in the course of learning vector representation, which can maximally preserve the heterogeneous network structural information and the network properties. At the same time, we also extend MDN-NMTF to a new version (called MDN-NMTF2) by using modular information to improve the miRNA-disease association prediction ability. Our methods and the other four existing methods are applied to predict miRNA-disease associations in four databases. The prediction results show that our methods can improve the miRNA-disease association prediction to a high level compared with the four existing methods.
| S-EPMC8223753 | biostudies-literature
Project description:BackgroundIn many applications of bioinformatics, data stem from distinct heterogeneous sources. One of the well-known examples is the identification of drug-target interactions (DTIs), which is of significant importance in drug discovery. In this paper, we propose a novel framework, manifold optimization based kernel preserving embedding (MOKPE), to efficiently solve the problem of modeling heterogeneous data. Our model projects heterogeneous drug and target data into a unified embedding space by preserving drug-target interactions and drug-drug, target-target similarities simultaneously.ResultsWe performed ten replications of ten-fold cross validation on four different drug-target interaction network data sets for predicting DTIs for previously unseen drugs. The classification evaluation metrics showed better or comparable performance compared to previous similarity-based state-of-the-art methods. We also evaluated MOKPE on predicting unknown DTIs of a given network. Our implementation of the proposed algorithm in R together with the scripts that replicate the reported experiments is publicly available at https://github.com/ocbinatli/mokpe .
| S-EPMC10324162 | biostudies-literature
Project description:BackgroundA typical task in bioinformatics consists of identifying which features are associated with a target outcome of interest and building a predictive model. Automated machine learning (AutoML) systems such as the Tree-based Pipeline Optimization Tool (TPOT) constitute an appealing approach to this end. However, in biomedical data, there are often baseline characteristics of the subjects in a study or batch effects that need to be adjusted for in order to better isolate the effects of the features of interest on the target. Thus, the ability to perform covariate adjustments becomes particularly important for applications of AutoML to biomedical big data analysis.ResultsWe developed an approach to adjust for covariates affecting features and/or target in TPOT. Our approach is based on regressing out the covariates in a manner that avoids 'leakage' during the cross-validation training procedure. We describe applications of this approach to toxicogenomics and schizophrenia gene expression data sets. The TPOT extensions discussed in this work are available at https://github.com/EpistasisLab/tpot/tree/v0.11.1-resAdj .ConclusionsIn this work, we address an important need in the context of AutoML, which is particularly crucial for applications to bioinformatics and medical informatics, namely covariate adjustments. To this end we present a substantial extension of TPOT, a genetic programming based AutoML approach. We show the utility of this extension by applications to large toxicogenomics and differential gene expression data. The method is generally applicable in many other scenarios from the biomedical field.
| S-EPMC7528347 | biostudies-literature
Project description:Protein language models, trained on millions of biologically observed sequences, generate feature-rich numerical representations of protein sequences. These representations, called sequence embeddings, can infer structure-functional properties, despite protein language models being trained on primary sequence alone. While sequence embeddings have been applied toward tasks such as structure and function prediction, applications toward alignment-free sequence classification have been hindered by the lack of studies to derive, quantify and evaluate relationships between protein sequence embeddings. Here, we develop workflows and visualization methods for the classification of protein families using sequence embedding derived from protein language models. A benchmark of manifold visualization methods reveals that Neighbor Joining (NJ) embedding trees are highly effective in capturing global structure while achieving similar performance in capturing local structure compared with popular dimensionality reduction techniques such as t-SNE and UMAP. The statistical significance of hierarchical clusters on a tree is evaluated by resampling embeddings using a variational autoencoder (VAE). We demonstrate the application of our methods in the classification of two well-studied enzyme superfamilies, phosphatases and protein kinases. Our embedding-based classifications remain consistent with and extend upon previously published sequence alignment-based classifications. We also propose a new hierarchical classification for the S-Adenosyl-L-Methionine (SAM) enzyme superfamily which has been difficult to classify using traditional alignment-based approaches. Beyond applications in sequence classification, our results further suggest NJ trees are a promising general method for visualizing high-dimensional data sets.
| S-EPMC9851311 | biostudies-literature
Project description:The tree of life (TOL) is severely threatened by climate and land-cover changes. Preserving the TOL is urgent, but has not been included in the post-2020 global biodiversity framework. Protected areas (PAs) are fundamental for biological conservation. However, we know little about the effectiveness of existing PAs in preserving the TOL of plants and how to prioritize PA expansion for better TOL preservation under future climate and land-cover changes. Here, using high-resolution distribution maps of 8732 woody species in China and phylogeny-based Zonation, we find that current PAs perform poorly in preserving the TOL both at present and in 2070s. The geographical coverage of TOL branches by current PAs is approx. 9%, and less than 3% of the identified priority areas for preserving the TOL are currently protected. Interestingly, the geographical coverage of TOL branches by PAs will be improved from 9% to 52-79% by the identified priority areas for PA expansion. Human pressures in the identified priority areas are high, leading to high cost for future PA expansion. We thus suggest that besides nature reserves and national parks, other effective area-based conservation measures should be considered. Our study argues for the inclusion of preserving the TOL in the post-2020 conservation framework, and provides references for decision-makers to preserve the Earth's evolutionary history.
| S-EPMC9727673 | biostudies-literature
Project description:Numerical embedding has become one standard technique for processing and analyzing unstructured data that cannot be expressed in a predefined fashion. It stores the main characteristics of data by mapping it onto a numerical vector. An embedding is often unsupervised and constructed by transfer learning from large-scale unannotated data. Given an embedding, a downstream learning method, referred to as a two-stage method, is applicable to unstructured data. In this article, we introduce a novel framework of embedding learning to deliver a higher learning accuracy than the two-stage method while identifying an optimal learning-adaptive embedding. In particular, we propose a concept of U-minimal sufficient learning-adaptive embeddings, based on which we seek an optimal one to maximize the learning accuracy subject to an embedding constraint. Moreover, when specializing the general framework to classification, we derive a graph embedding classifier based on a hyperlink tensor representing multiple hypergraphs, directed or undirected, characterizing multi-way relations of unstructured data. Numerically, we design algorithms based on blockwise coordinate descent and projected gradient descent to implement linear and feed-forward neural network classifiers, respectively. Theoretically, we establish a learning theory to quantify the generalization error of the proposed method. Moreover, we show, in linear regression, that the one-hot encoder is more preferable among two-stage methods, yet its dimension restriction hinders its predictive performance. For a graph embedding classifier, the generalization error matches up to the standard fast rate or the parametric rate for linear or nonlinear classification. Finally, we demonstrate the utility of the classifiers on two benchmarks in grammatical classification and sentiment analysis. Supplementary materials for this article are available online.
| S-EPMC10022456 | biostudies-literature
Project description:Fragment embedding is one way to circumvent the high computational scaling of accurate electron correlation methods. The challenge of applying fragment embedding to molecular systems primarily lies in the strong entanglement and correlation that prevent accurate fragmentation across chemical bonds. Recently, Schmidt decomposition has been shown effective for embedding fragments that are strongly coupled to a bath in several model systems. In this work, we extend a recently developed quantum embedding scheme, bootstrap embedding (BE), to molecular systems. The resulting method utilizes the matching conditions naturally arising from using overlapping fragments to optimize the embedding. Numerical simulation suggests that the accuracy of the embedding improves rapidly with fragment size for small molecules, whereas larger fragments that include orbitals from different atoms may be needed for larger molecules. BE scales linearly with system size (apart from an integral transform) and hence can potentially be useful for large-scale calculations.
| S-EPMC6727622 | biostudies-literature
Project description:PurposeDespite the many progresses with alignment algorithms, aligning divergent protein sequences with less than 20-35% pairwise identity (so called "twilight zone") remains a difficult problem. Many alignment algorithms have been using substitution matrices since their creation in the 1970's to generate alignments, however, these matrices do not work well to score alignments within the twilight zone. We developed Protein Embedding based Alignments, or PEbA, to better align sequences with low pairwise identity. Similar to the traditional Smith-Waterman algorithm, PEbA uses a dynamic programming algorithm but the matching score of amino acids is based on the similarity of their embeddings from a protein language model.MethodsWe tested PEbA on over twelve thousand benchmark pairwise alignments from BAliBASE, each one extracted from one of their multiple sequence alignments. Five different BAliBASE references were used, each with different sequence identities, motifs, and lengths, allowing PEbA to showcase how well it aligns under different circumstances.ResultsPEbA greatly outperformed BLOSUM substitution matrix-based pairwise alignments, achieving different levels of improvements of the alignment quality for pairs of sequences with different levels of similarity (over four times as well for pairs of sequences with <10% identity). We also compared PEbA with embeddings generated by different protein language models (ProtT5 and ESM-2) and found that ProtT5-XL-U50 produced the most useful embeddings for aligning protein sequences. PEbA also outperformed DEDAL and vcMSA, two recently developed protein language model embedding-based alignment methods.ConclusionOur results suggested that general purpose protein language models provide useful contextual information for generating more accurate protein alignments than typically used methods.
| S-EPMC10900708 | biostudies-literature