Dataset Information

A deep generative framework with embedded vector arithmetic and classifier for sample generation, label transfer, and clustering of single-cell data.

ABSTRACT: Multiple-source single-cell datasets have accumulated quickly and need computational methods to integrate and decompose into meaningful components. Here, we present inClust (integrated clustering), a flexible deep generative framework that enables embedding auxiliary information, latent space vector arithmetic, and clustering. All functional parts are relatively modular, independent in implementation but interrelated at runtime, resulting in an all-in general framework that could work in supervised, semi-supervised, or unsupervised mode. We show that inClust is superior to most data integration methods in benchmark datasets. Then, we demonstrate the capability of inClust in the tasks of conditional out-of-distribution generation in supervised mode, label transfer in semi-supervised mode, and spatial domain identification in unsupervised mode. In these examples, inClust could accurately express the effect of each covariate, distinguish the query-specific cell types, or segment spatial domains. The results support that inClust is an excellent general framework for multiple-task harmonization and data decomposition.

SUBMITTER: Wang L

PROVIDER: S-EPMC10475846 | biostudies-literature | 2023 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

A deep generative framework with embedded vector arithmetic and classifier for sample generation, label transfer, and clustering of single-cell data.

Wang Lifei L Nie Rui R Zhang Zhang Z Gu Weiwei W Wang Shuo S Wang Anqi A Zhang Jiang J Cai Jun J

Cell reports methods 20230810 8

Multiple-source single-cell datasets have accumulated quickly and need computational methods to integrate and decompose into meaningful components. Here, we present inClust (integrated clustering), a flexible deep generative framework that enables embedding auxiliary information, latent space vector arithmetic, and clustering. All functional parts are relatively modular, independent in implementation but interrelated at runtime, resulting in an all-in general framework that could work in supervi ...[more]

PMID: 37671019

Similar Datasets

Project description:The present study aimed to identify the feature genes associated with smoking in lung adenocarcinoma (LAC) samples and explore the underlying mechanism. Three gene expression datasets of LAC samples were downloaded from the Gene Expression Omnibus database through pre‑set criteria and the expression data were processed using meta‑analysis. Differentially expressed genes (DEGs) between LAC samples of smokers and non‑smokers were identified using limma package in R. The classification accuracy of selected DEGs were visualized using hierarchical clustering analysis in R language. A protein‑protein interaction (PPI) network was constructed using gene interaction data from the Human Protein Reference Database for the DEGs. Betweenness centrality was calculated for each node in the network and genes with the greatest BC values were utilized for the construction of the support vector machine (SVM) classifier. The dataset GSE43458 was used as the training dataset for the construction and the other datasets (GSE12667 and GSE10072) were used as the validation datasets. The classification accuracy of the classifier was tested using sensitivity, specificity, positive predictive value, negative predictive value and area under curve parameters with the pROC package in R language. The feature genes in the SVM classifier were subjected to pathway enrichment analysis using Fisher's exact test. A total of 347 genes were identified to be differentially expressed between samples of smokers and non‑smokers. The PPI network of DEGs were comprised of 202 nodes and 300 edges. An SVM classifier comprised of 26 feature genes was constructed to distinguish between different LAC samples, with prediction accuracies for the GSE43458, GSE12667 and GSE10072 datasets of 100, 100 and 94.83%, respectively. Furthermore, the 26 feature genes that were significantly enriched in 9 overrepresented biological pathways, including extracellular matrix‑receptor interaction, proteoglycans in cancer, cell adhesion molecules, p53 signaling pathway, microRNAs in cancer and apoptosis, were identified to be smoking‑related genes in LAC. In conclusion, an SVM classifier with a high prediction accuracy for smoking and non‑smoking samples was obtained. The genes in the classifier may likely be the potential feature genes associated with the development of patients with LAC who smoke.

Project description:Vehicular Adhoc Network (VANET) suffers from the loss of perilous data packets and disruption of links due to the fast movement of vehicles and dynamic network topology. Moreover, the reliability of the vehicular network is also threatened by malicious vehicles and messages. The malicious vehicle can promulgate fake messages to the node to misguide it, which may result in the loss of precious lives. In this situation, maintaining efficient, reliable, and secure communication among automobiles is of extreme importance, especially for a densely populated network. One of the remedies is vehicular clustering, which can effectively perform in a high-density network. However, secure cluster formation and cluster optimization are important factors to consider during the clustering process because non-optimal clusters may incur high end-to-end communication delays and produce overhead on the network. In addition, malicious nodes and packets reduce passenger and driver safety, increase road accidents, and waste passenger and driver time. To this end, we employ Arithmetic Optimization Algorithm (AOA) to design a secure intelligent clustering named AOACNET. AOA is used to achieve optimality of vehicular clusters. During cluster formation, the algorithm prevents unauthentic nodes from becoming cluster members by taking into consideration the performance value of each automobile. The vehicle's performance value is based on the record of data transmission. If a vehicle transmits a fake message, it will receive a penalty of (-1), and in the case of transmitting a legitimate message, a reward of (+1) will be assigned to the vehicle. Initially, all the vehicles have equal performance value which either increase or decrease based on communication with their peers. The vehicles will become cluster members only if their performance value is greater than the threshold value (0). AOACNET is tested in MATLAB using various evaluation metrics (i.e., number of clusters, load balancing, computational time, network overhead and delay). The simulation results show that the proposed algorithm performs up to 25% better than the similar contenders in terms of designated optimization objectives.

Project description:BackgroundTemporal analysis of gene expression data has been limited to identifying genes whose expression varies with time and/or correlation between genes that have similar temporal profiles. Often, the methods do not consider the underlying network constraints that connect the genes. It is becoming increasingly evident that interactions change substantially with time. Thus far, there is no systematic method to relate the temporal changes in gene expression to the dynamics of interactions between them. Information on interaction dynamics would open up possibilities for discovering new mechanisms of regulation by providing valuable insight into identifying time-sensitive interactions as well as permit studies on the effect of a genetic perturbation.ResultsWe present NETGEM, a tractable model rooted in Markov dynamics, for analyzing the dynamics of the interactions between proteins based on the dynamics of the expression changes of the genes that encode them. The model treats the interaction strengths as random variables which are modulated by suitable priors. This approach is necessitated by the extremely small sample size of the datasets, relative to the number of interactions. The model is amenable to a linear time algorithm for efficient inference. Using temporal gene expression data, NETGEM was successful in identifying (i) temporal interactions and determining their strength, (ii) functional categories of the actively interacting partners and (iii) dynamics of interactions in perturbed networks.ConclusionsNETGEM represents an optimal trade-off between model complexity and data requirement. It was able to deduce actively interacting genes and functional categories from temporal gene expression data. It permits inference by incorporating the information available in perturbed networks. Given that the inputs to NETGEM are only the network and the temporal variation of the nodes, this algorithm promises to have widespread applications, beyond biological systems.The source code for NETGEM is available from https://github.com/vjethava/NETGEM.

Dataset Information

A deep generative framework with embedded vector arithmetic and classifier for sample generation, label transfer, and clustering of single-cell data.

Publications

A deep generative framework with embedded vector arithmetic and classifier for sample generation, label transfer, and clustering of single-cell data.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets