Constructing Cell-type Taxonomy by Optimal Transport with Relaxed Marginal Constraints

• URL: http://arxiv.org/abs/2501.18650v1
• Date: Wed, 29 Jan 2025 21:29:25 GMT
• Title: Constructing Cell-type Taxonomy by Optimal Transport with Relaxed Marginal Constraints
• Authors: Sebastian Pena, Lin Lin, Jia Li,
• Abstract summary: One challenge in the cluster analysis of cells is matching clusters extracted from datasets of different origins or conditions. Our approach aims to construct a taxonomy for cell clusters across all samples to better annotate these clusters and effectively extract features for downstream analysis.
• Score: 14.831346286039151
• License:
• Abstract: The rapid emergence of single-cell data has facilitated the study of many different biological conditions at the cellular level. Cluster analysis has been widely applied to identify cell types, capturing the essential patterns of the original data in a much more concise form. One challenge in the cluster analysis of cells is matching clusters extracted from datasets of different origins or conditions. Many existing algorithms cannot recognize new cell types present in only one of the two samples when establishing a correspondence between clusters obtained from two samples. Additionally, when there are more than two samples, it is advantageous to align clusters across all samples simultaneously rather than performing pairwise alignment. Our approach aims to construct a taxonomy for cell clusters across all samples to better annotate these clusters and effectively extract features for downstream analysis. A new system for constructing cell-type taxonomy has been developed by combining the technique of Optimal Transport with Relaxed Marginal Constraints (OT-RMC) and the simultaneous alignment of clusters across multiple samples. OT-RMC allows us to address challenges that arise when the proportions of clusters vary substantially between samples or when some clusters do not appear in all the samples. Experiments on more than twenty datasets demonstrate that the taxonomy constructed by this new system can yield highly accurate annotation of cell types. Additionally, sample-level features extracted based on the taxonomy result in accurate classification of samples.

Related papers

• HBIC: A Biclustering Algorithm for Heterogeneous Datasets [0.0]
  Biclustering is an unsupervised machine-learning approach aiming to cluster rows and columns simultaneously in a data matrix. We introduce a biclustering approach called HBIC, capable of discovering meaningful biclusters in complex heterogeneous data.
  arXiv  Detail & Related papers  (2024-08-23T16:48:10Z)
• scGHSOM: Hierarchical clustering and visualization of single-cell and CRISPR data using growing hierarchical SOM [0.8452349885923507]
  We propose a comprehensive gene-cell dependency visualization via unsupervised clustering, Growing Hierarchical Self-Organizing Map (GHSOM) GHSOM is applied to cluster samples in a hierarchical structure such that the self-growth structure of clusters satisfies the required variations between and within. We present two innovative visualization tools: Cluster Feature Map and Cluster Distribution Map.
  arXiv  Detail & Related papers  (2024-07-24T04:01:09Z)
• Single-cell Multi-view Clustering via Community Detection with Unknown Number of Clusters [64.31109141089598]
  We introduce scUNC, an innovative multi-view clustering approach tailored for single-cell data. scUNC seamlessly integrates information from different views without the need for a predefined number of clusters. We conducted a comprehensive evaluation of scUNC using three distinct single-cell datasets.
  arXiv  Detail & Related papers  (2023-11-28T08:34:58Z)
• Generalized Category Discovery with Clustering Assignment Consistency [56.92546133591019]
  Generalized category discovery (GCD) is a recently proposed open-world task. We propose a co-training-based framework that encourages clustering consistency. Our method achieves state-of-the-art performance on three generic benchmarks and three fine-grained visual recognition datasets.
  arXiv  Detail & Related papers  (2023-10-30T00:32:47Z)
• Bayesian outcome-guided multi-view mixture models with applications in molecular precision medicine [0.0]
  Clustering is commonly performed as an initial analysis step for uncovering structure in 'omics datasets. We propose a multi-view Bayesian mixture model that identifies groups of variables (views"), each of which defines a distinct clustering structure. We consider applications in stratified medicine, for which our principal goal is to identify clusters of patients that define distinct, clinically actionable disease subtypes.
  arXiv  Detail & Related papers  (2023-03-01T08:32:23Z)
• Sparse and geometry-aware generalisation of the mutual information for joint discriminative clustering and feature selection [19.066989850964756]
  We introduce a discriminative clustering model trying to maximise a geometry-aware generalisation of the mutual information called GEMINI. This algorithm avoids the burden of feature exploration and is easily scalable to high-dimensional data and large amounts of samples while only designing a discriminative clustering model. Our results show that Sparse GEMINI is a competitive algorithm and has the ability to select relevant subsets of variables with respect to the clustering without using relevance criteria or prior hypotheses.
  arXiv  Detail & Related papers  (2023-02-07T10:52:04Z)
• Composite Feature Selection using Deep Ensembles [130.72015919510605]
  We investigate the problem of discovering groups of predictive features without predefined grouping. We introduce a novel deep learning architecture that uses an ensemble of feature selection models to find predictive groups. We propose a new metric to measure similarity between discovered groups and the ground truth.
  arXiv  Detail & Related papers  (2022-11-01T17:49:40Z)
• LSD-C: Linearly Separable Deep Clusters [145.89790963544314]
  We present LSD-C, a novel method to identify clusters in an unlabeled dataset. Our method draws inspiration from recent semi-supervised learning practice and proposes to combine our clustering algorithm with self-supervised pretraining and strong data augmentation. We show that our approach significantly outperforms competitors on popular public image benchmarks including CIFAR 10/100, STL 10 and MNIST, as well as the document classification dataset Reuters 10K.
  arXiv  Detail & Related papers  (2020-06-17T17:58:10Z)
• A Novel Granular-Based Bi-Clustering Method of Deep Mining the Co-Expressed Genes [76.84066556597342]
  Bi-clustering methods are used to mine bi-clusters whose subsets of samples (genes) are co-regulated under their test conditions. Unfortunately, traditional bi-clustering methods are not fully effective in discovering such bi-clusters. We propose a novel bi-clustering method by involving here the theory of Granular Computing.
  arXiv  Detail & Related papers  (2020-05-12T02:04:40Z)
• Clustering Binary Data by Application of Combinatorial Optimization Heuristics [52.77024349608834]
  We study clustering methods for binary data, first defining aggregation criteria that measure the compactness of clusters. Five new and original methods are introduced, using neighborhoods and population behavior optimization metaheuristics. From a set of 16 data tables generated by a quasi-Monte Carlo experiment, a comparison is performed for one of the aggregations using L1 dissimilarity, with hierarchical clustering, and a version of k-means: partitioning around medoids or PAM.
  arXiv  Detail & Related papers  (2020-01-06T23:33:31Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.