Differentiable Graph Clustering with Structural Grouping for Single-cell RNA-seq Data.

Xiaoqiang Yan, Shike Du, Quan Zou, Zhen Tian
{"title":"Differentiable Graph Clustering with Structural Grouping for Single-cell RNA-seq Data.","authors":"Xiaoqiang Yan, Shike Du, Quan Zou, Zhen Tian","doi":"10.1093/bioinformatics/btaf347","DOIUrl":null,"url":null,"abstract":"<p><strong>Motivation: </strong>Clustering cells into subpopulations is one of the most crucial tasks in single-cell RNA sequencing (scRNA-seq) data analysis, which provides support for biological research at cellular level. With the development of graph neural networks, deep graph clustering approaches have achieved excellent performance by modelling the topological relationships between cells. However, existing approaches rely on cell node and its neighbors to obtain the cell feature representation, which ignore the graph cluster structure hidden in scRNA-seq data. Besides, how to bridge the heterogeneous gap between cell node feature and its structural information remains a highly challenging problem.</p><p><strong>Results: </strong>Here, we propose a novel differentiable graph clustering with structural grouping (DGCSG) for scRNA-seq data, which incorporates graph cluster information into deep graph clustering model by designing a differentiable clustering mechanism to learn clustering-friendly representation. Firstly, an interactive module is devised to dynamically transfer node representations learned by autoencoder (AE) to graph attention autoencoder (GATE) in layer-by-layer manner. Then, to characterize graph cluster information, a differentiable clustering mechanism is proposed to transform K-way normalized cuts from a discrete optimization problem into differentiable learning objective through spectral relaxation, which jointly optimizes the graph attention autoencoder by allocating more attention scores to nodes in the same graph cluster. Finally, a decoupled self-supervised optimization is proposed, which guides the representation learning of AE and GATE in the interactive module. Extensive evaluations on 14 scRNA-seq benchmarks verify the superiority of DGCSG compared with state-of-the-art baselines.</p><p><strong>Availability: </strong>https://github.com/Xiaoqiang-Yan/DGCSG.</p><p><strong>Supplementary information: </strong>Supplementary data are available at Bioinformatics online.</p>","PeriodicalId":93899,"journal":{"name":"Bioinformatics (Oxford, England)","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2025-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bioinformatics (Oxford, England)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1093/bioinformatics/btaf347","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Motivation: Clustering cells into subpopulations is one of the most crucial tasks in single-cell RNA sequencing (scRNA-seq) data analysis, which provides support for biological research at cellular level. With the development of graph neural networks, deep graph clustering approaches have achieved excellent performance by modelling the topological relationships between cells. However, existing approaches rely on cell node and its neighbors to obtain the cell feature representation, which ignore the graph cluster structure hidden in scRNA-seq data. Besides, how to bridge the heterogeneous gap between cell node feature and its structural information remains a highly challenging problem.

Results: Here, we propose a novel differentiable graph clustering with structural grouping (DGCSG) for scRNA-seq data, which incorporates graph cluster information into deep graph clustering model by designing a differentiable clustering mechanism to learn clustering-friendly representation. Firstly, an interactive module is devised to dynamically transfer node representations learned by autoencoder (AE) to graph attention autoencoder (GATE) in layer-by-layer manner. Then, to characterize graph cluster information, a differentiable clustering mechanism is proposed to transform K-way normalized cuts from a discrete optimization problem into differentiable learning objective through spectral relaxation, which jointly optimizes the graph attention autoencoder by allocating more attention scores to nodes in the same graph cluster. Finally, a decoupled self-supervised optimization is proposed, which guides the representation learning of AE and GATE in the interactive module. Extensive evaluations on 14 scRNA-seq benchmarks verify the superiority of DGCSG compared with state-of-the-art baselines.

Availability: https://github.com/Xiaoqiang-Yan/DGCSG.

Supplementary information: Supplementary data are available at Bioinformatics online.

单细胞RNA-seq数据的结构分组可微图聚类。
动机:将细胞聚类成亚群是单细胞RNA测序(scRNA-seq)数据分析中最关键的任务之一,为细胞水平的生物学研究提供支持。随着图神经网络的发展,深度图聚类方法通过对细胞之间的拓扑关系进行建模,取得了优异的性能。然而,现有的方法依赖于细胞节点及其邻居来获得细胞特征表示,忽略了scRNA-seq数据中隐藏的图簇结构。此外,如何弥合细胞节点特征与其结构信息之间的异构差距仍然是一个极具挑战性的问题。结果:本文针对scRNA-seq数据提出了一种新的结构分组可微图聚类方法(DGCSG),通过设计可微聚类机制,将图聚类信息融入深度图聚类模型中,学习聚类友好表示。首先,设计了一个交互模块,将自编码器(AE)学习到的节点表示逐层动态传递给图注意力自编码器(GATE);然后,为了刻画图簇信息,提出了一种可微聚类机制,通过谱松弛将K-way归一化切从离散优化问题转化为可微学习目标,通过向同一图簇中的节点分配更多的注意分数来共同优化图注意力自编码器。最后,提出了一种解耦自监督优化方法,指导交互模块中AE和GATE的表示学习。对14个scRNA-seq基准的广泛评估验证了DGCSG与最先进基线相比的优越性。可用性:https://github.com/Xiaoqiang-Yan/DGCSG.Supplementary信息:补充数据可在Bioinformatics在线获取。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信