Soft Graph Clustering for single-cell RNA Sequencing Data
Not on the map. Why?
Abstract (arXiv)
Clustering analysis is fundamental in single-cell RNA sequencing (scRNA-seq) data analysis for elucidating cellular heterogeneity and diversity. Recent graph-based scRNA-seq clustering methods, particularly graph neural networks (GNNs), have significantly improved in tackling the challenges of high-dimension, high-sparsity, and frequent dropout events that lead to ambiguous cell population boundaries. However, their reliance on hard graph constructions derived from thresholded similarity matrices presents challenges:(i) The simplification of intercellular relationships into binary edges (0 or 1) by applying thresholds, which restricts the capture of continuous similarity features among cells and leads to significant information loss.(ii) The presence of significant inter-cluster connections within hard graphs, which can confuse GNN methods that rely heavily on graph structures, potentially causing erroneous message propagation and biased clustering outcomes. To tackle these challenges, we introduce scSGC, a Soft Graph Clustering for single-cell RNA sequencing data, which aims to more accurately characterize continuous similarities among cells through non-binary edge weights, thereby mitigating the limitations of rigid data structures. The scSGC framework comprises three core components: (i) a zero-inflated negative binomial (ZINB)-based feature autoencoder; (ii) a dual-channel cut-informed soft graph embedding module; and (iii) an optimal transport-based clustering optimization module. Extensive experiments across ten datasets demonstrate that scSGC outperforms 13 state-of-the-art clustering models in clustering accuracy, cell type annotation, and computational efficiency. These results highlight its substantial potential to advance scRNA-seq data analysis and deepen our understanding of cellular heterogeneity.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 11 of its 48 references that are in the map. First posted on arXiv 14 Jul 2025.
Builds on
11 of 48 references.
References · 11
- 2015Unsupervised Deep Embedding for Clustering Analysiscited by 767
- 2019Measuring and Relieving the Over-smoothing Problem for Graph Neural Networks from the Topological Viewcited by 545
- 2018From Louvain to Leiden: guaranteeing well-connected communitiescited by 385
- 2024A Comprehensive Survey on Data Augmentationcited by 40
- 2022Graph Soft-Contrastive Learning via Neighborhood Rankingcited by 16
- 2021LightCAKE: A Lightweight Framework for Context-Aware Knowledge Graph Embeddingcited by 11
- 2024scCDCG: Efficient Deep Structural Clustering for single-cell RNA-seq via Deep Cut-informed Graph Embeddingcited by 10
- 2025Deep Cut-informed Graph Embedding and Clusteringcited by 7
- 2025scSiameseClu: A Siamese Clustering Framework for Interpreting single-cell RNA Sequencing Datacited by 6
- 2025Rethinking Graph Contrastive Learning through Relative Similarity Preservationcited by 5
- 2024Make Graph Neural Networks Great Again: A Generic Integration Paradigm of Topology-Free Patterns for Traffic Speed Predictioncited by 4
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.