Bipartite Graph Attention-based Clustering for Large-scale scRNA-seq Data
scRNA-seq clustering is a critical task for analyzing single-cell RNA sequencing (scRNA-seq) data, as it groups cells with similar gene expression profiles. Transformers, as powerful foundational models, have been applied to scRNA-seq clustering. Their self-attention mechanism automatically assigns higher attention weights to cells within the same cluster, enhancing the distinction between clusters. Existing methods for scRNA-seq clustering, such as graph transformer-based models, treat each cell as a token in a sequence. Their computational and space complexities are $\mathcal{O}(n^2)$ with respect to the number of cells, limiting their applicability to large-scale scRNA-seq datasets.To address this challenge, we propose a Bipartite Graph Transformer-based clustering model (BGFormer) for scRNA-seq data. We introduce a set of learnable anchor tokens as shared reference points to represent the entire dataset. A bipartite graph attention mechanism is introduced to learn the similarity between cells and anchor tokens, bringing cells of the same class closer together in the embedding space. BGFormer achieves linear computational complexity with respect to the number of cells, making it scalable to large datasets. Experimental results on multiple large-scale scRNA-seq datasets demonstrate the effectiveness and scalability of BGFormer.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Highly-Efficient Incomplete Large-Scale Multi-View Clustering With Consensus Bipartite Graph
Multi-view clustering has received increasing attention due to its effectiveness in fusing complementary information without manual annotations. Most previous methods hold the assumption that each instance appears in…
ClusteringIncomplete multi-view clusteringOne-step Bipartite Graph Cut: A Normalized Formulation and Its Application to Scalable Subspace Clustering
The bipartite graph structure has shown its promising ability in facilitating the subspace clustering and spectral clustering algorithms for large-scale datasets. To avoid the post-processing via k-means during the bipar…
ClusteringGraph Learninggraph partitioningLarge-scale spectral clustering using diffusion coordinates on landmark-based bipartite graphs
Spectral clustering has received a lot of attention due to its ability to separate nonconvex, non-intersecting manifolds, but its high computational complexity has significantly limited its applicability. Motivated by th…
ClusteringImage/Document ClusteringSemantic SegmentationEfficient Multi-view Clustering via Unified and Discrete Bipartite Graph Learning
Although previous graph-based multi-view clustering algorithms have gained significant progress, most of them are still faced with three limitations. First, they often suffer from high computational complexity, which res…
ClusteringGraph LearningEfficient High-Quality Clustering for Large Bipartite Graphs
A bipartite graph contains inter-set edges between two disjoint vertex sets, and is widely used to model real-world data, such as user-item purchase records, author-article publications, and biological interactions betwe…
ClusteringGraph ClusteringRecommendation Systems