计算机科学 ›› 2026, Vol. 53 ›› Issue (9): 173-179.doi: 10.11896/jsjkx.260500130

• 数据库&大数据&数据科学 • 上一篇    下一篇

融合模糊聚类与回滚式门控的结构深度聚类

邹敬, 王平心   

  1. 江苏科技大学理学院 江苏 镇江 212100
  • 收稿日期:2026-05-26 修回日期:2026-07-02 出版日期:2026-09-15 发布日期:2026-09-10
  • 通讯作者: 王平心(pingxin_wang@hotmail.com)
  • 作者简介:(zoujing.cs@outlook.com)
  • 基金资助:
    国家自然科学基金(62076111,61773012);江苏省高校自然科学基金(15KJB110004)

Structural Deep Clustering with Fuzzy C-means Refinement and Rollback Gating

ZOU Jing, WANG Pingxin   

  1. School of Science,Jiangsu University of Science and Technology,Zhenjiang,Jiangsu 212100,China
  • Received:2026-05-26 Revised:2026-07-02 Published:2026-09-15 Online:2026-09-10
  • About author:ZOU Jing,born in 2002,postgraduate.His main research interests include machine learning and deep clustering.
    WANG Pingxin,born in 1980,Ph.D,professor.His main research interests include matrix analysis,three-way decision,and rough set theory.
  • Supported by:
    National Natural Science Foundation of China(62076111,61773012) and Natural Science Foundation of Jiangsu Higher Education Institutions of China(15KJB110004).

摘要: 结构深度聚类(SDCN)通过融合自编码器与图卷积网络(GCN),能够在聚类过程中同时利用样本特征信息与图结构信息。传统SDCN的聚类中心主要依赖目标分布驱动的隐式优化,对边界样本和类别不均衡情形较为敏感。尤其是在样本分布复杂、类间边界模糊或邻接关系存在噪声的情况下,中心偏移会进一步放大伪标签误差,并削弱结构分支与属性分支之间的协同优化效果。为解决这一问题,在SDCN的基础上引入模糊C-均值(FCM)中心细化和回滚式门控机制,提出一种改进的结构深度聚类算法(SDCN+FCM)。该算法通过周期性显式细化聚类中心,改善中心估计质量,并利用基于KL散度的回滚式门控判断是否接受本次中心更新,从而抑制有害更新并提高训练稳定性。在USPS,HHAR,REUT,ACM和DBLP 5个数据集上的实验结果表明,所提出的方法在多个数据集的核心指标上均优于原始SDCN,并表现出更好的训练稳定性。

关键词: 深度聚类, 结构深度聚类, 图卷积网络, 模糊C-均值, 回滚式门控, 自监督学习

Abstract: Structural deep clustering(SDCN) integrates autoencoders and graph convolutional networks(GCN) to jointly leverage sample feature information and graph structural information during clustering.Traditional SDCN primarily relies on distribution-driven implicit optimization of cluster centers,making it sensitive to boundary samples and class imbalance.In particular,when sample distributions are complex,inter-class boundaries are ambiguous,or adjacency relations contain noise,deviations of cluster centers may further amplify pseudo-label errors and weaken the collaborative optimization between the structural branch and the attribute branch.To address this limitation,this work introduces fuzzy C-means(FCM) center refinement combined with a rollback gating mechanism,resulting in an improved structural deep clustering algorithm,denoted as SDCN+FCM.The proposed algorithm improves the quality of center estimation by periodically and explicitly refining cluster centers,and utilizes a KL divergence-based rollback gating mechanism to determine whether to accept the current center update,thereby mitigating harmful updates and enhancing training stability.Experimental results on the USPS,HHAR,REUT,ACM,and DBLP datasets demonstrate that the proposed algorithm outperforms conventional SDCN on the primary evaluation metric across these datasets,while exhibiting improved training stability.

Key words: Deep clustering, Structural deep clustering, Graph convolutional networks, Fuzzy C-means, Rollback gating, Self-supervised learning

中图分类号: 

  • TP181
[1] MIN E,GUO X,LIU Q,et al.A Survey of Clustering With Deep Learning:From the Perspective of Network Architecture[J].IEEE Access,2018,6:39501-39514.
[2] ZHOU Z H.Machine Learning[M].Beijing:Tsinghua University Press,2016.
[3] TORTORA C,PALUMBO F.Clustering Mixed-Type DataUsing a Probabilistic Distance Algorithm[J].Applied Soft Computing,2022,130:109704.
[4] XU T J,WANG P X,YANG X B.Three-Way K-Means Clustering Algorithm Based on Artificial Bee Colony[J].Computer Science,2023,50(6):116-121.
[5] LI J X.Research on Clustering Analysis Based on Graph Representation[D].Taiyuan:Shanxi University,2023.
[6] GAO Y L,YANG C Y,WANG Z H,et al.Robust Fuzzy C-means Clustering Algorithm Integrating Between-cluster Information[J].Journal of Electronics & Information Technology,2019,41(5):1114-1121.
[7] ZHANG R,LI X,ZHANG H,et al.Deep Fuzzy K-Means With Adaptive Loss and Entropy Regularization[J].IEEE Transactions on Fuzzy Systems,2020,28(11):2814-2824.
[8] AN J X,LIU Y,YANG L W.A Review of Deep ClusteringBased on Contrastive Learning[J].Microelectronics & Compu-ter,2025,42(7):1-10.
[9] XIE J,GIRSHICK R,FARHADI A.Unsupervised Deep Em-bedding for Clustering Analysis[C] //Proceedings of the 33rd International Conference on Machine Learning.2016:478-487.
[10] XIA W,WANG Q,GAO Q,et al.Self-Supervised Graph Convolutional Network for Multi-View Clustering[J].IEEE Transactions on Multimedia,2022,24:3182-3192.
[11] MRABAH N,BOUGUESSA M,TOUATI M F,et al.Rethinking Graph Auto-Encoder Models for Attributed Graph Clustering[J].IEEE Transactions on Knowledge and Data Enginee-ring,2023,35(5):4731-4745.
[12] BO D,WANG X,SHI C,et al.Structural Deep Clustering Network[C] //Proceedings of The Web Conference 2020.New York:ACM,2020:1400-1410.
[13] WANG S,YANG J,YAO J,et al.An Overview of Advanced Deep Graph Node Clustering[J].IEEE Transactions on Computational Social Systems,2024,11(1):1302-1314.
[14] XU J,WANG L S.A Contrastive Clustering Method with Consistent Structural Relations[J].Computer Science,2023,50(9):123-129.
[15] WANG C,LIANG W,LI D,et al.Adaptive deep graph clustering via layer-wise gated fusion and cross-view contrastive alignment[J].Applied Sciences,2026,16(4):2131.
[16] CHEN T,KORNBLITH S,NOROUZI M,et al.A SimpleFramework for Contrastive Learning of Visual Representations[C] //Proceedings of the 37th International Conference on Machine Learning.PMLR,2020:1597-1607.
[17] WANG J H,WANG H,YUAN C.A Graph Clustering Method Based on Autoencoder and Contrastive Loss[J].Journal of Nanjing Normal University(Natural Science Edition),2025,48(1):75-84.
[18] WANG C,PAN S,HU R,et al.Attributed Graph Clustering:A Deep Attentional Embedding Approach[C] //Proceedings of theTwenty-Eighth International Joint Conference on Artificial Intelligence.IJCAI,2019:3670-3676.
[19] TU W,ZHOU S,LIU X,et al.Deep Fusion Clustering Network[C] //Proceedings of the AAAI Conference on Artificial Intelligence.2021:9978-9987.
[20] LIU Y,TU W,ZHOU S,et al.Deep Graph Clustering via Dual Correlation Reduction[C] //Proceedings of the AAAI Confe-rence on Artificial Intelligence.2022:7603-7611.
[21] GAO Y L,LAI W X,PAN J Y,et al.An Adaptive Sparse Fuzzy Clustering Model[J].Journal of Xiamen University(Natural Science),2021,60(6):1001-1010.
[22] GUO J,CAI C Y,LU Y,et al.A Deep Three-Way FCM Clustering Method Based on Evidential Information Granulation[J].Journal of Nanjing Normal University(Natural Science Edition),2025,48(4):106-117.
[23] XU C,LIN R,CAI J,et al.Deep Image Clustering by FusingContrastive Learning and Neighbor Relation Mining[J].Know-ledge-Based Systems,2022,238:107967.
[24] GAGOLEWSKI M.Normalised Clustering Accuracy:An Asymmetric External Cluster Validity Measure[J].Journal of Classification,2025,42:2-30.
[25] MAHMOUDI A,JEMIELNIAK D.Proof of Biased Behavior of Normalized Mutual Information[J].Scientific Reports,2024,14:9021.
[26] WARRENS M J,VAN DER HOEF H.Understanding the Adjusted Rand Index and Other Partition Comparison Indices Based on Counting Object Pairs[J].Journal of Classification,2022,39:487-509.
[27] MA C H,TANG C S,DENG Z Q,et al.Prototype Based Contrastive Graph Clustering Network for Reducing False Negatives[J].Scientific Reports,2025,15:35584.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!