Journal of Computer Applications ›› 2026, Vol. 46 ›› Issue (9): 2827-2837.DOI: 10.11772/j.issn.1001-9081.2025081008

• Data science and technology • Previous Articles    

Attribute-missing graph clustering model based on stacked joint optimization

Xiben LUO, Xiaoyun CHEN()   

  1. School of Mathematics and Statistics,Fuzhou University,Fuzhou Fujian 350108,China
  • Received:2025-09-03 Revised:2025-12-01 Accepted:2025-12-10 Online:2026-02-12 Published:2026-09-10
  • Contact: Xiaoyun CHEN
  • About author:LUO Xiben, born in 1999, M. S. candidate. Her research interests include machine learning, node clustering.
    CHEN Xiaoyun, born in 1970, Ph. D., professor. Her research interests include machine learning, pattern recognition.
  • Supported by:
    Natural Science Foundation of Fujian Province(2022J01102)

堆叠式联合优化属性缺失图聚类模型

罗细奔, 陈晓云()   

  1. 福州大学 数学与统计学院,福州 350108
  • 通讯作者: 陈晓云
  • 作者简介:罗细奔(1999—),女,贵州册亨人,硕士研究生,CCF会员,主要研究方向:机器学习、节点聚类
    陈晓云(1970—),女,福建晋江人,教授,博士,主要研究方向:机器学习、模式识别。
  • 基金资助:
    福建省自然科学基金资助项目(2022J01102)

Abstract:

To address the inconsistency between attribute completion and clustering objectives in two-stage methods and the low efficiency of deep learning methods for attribute-missing graph clustering, an Attribute-Missing Graph Clustering model based on Stacked Joint Optimization (AMGC-SJO) was proposed. First, a Matrix Factorization-based Attribute-Missing Graph Clustering model (AMGC-MF) was constructed, which introduced an enhanced adjacency matrix to represent global node connection relations and employed graph regularization for attribute completion, and then a joint Non-negative Matrix Factorization (NMF) was applied to the completed the attribute matrix and enhanced adjacency matrix, so as to learn the node clustering degrees of membership. On this basis, an AMGC-SJO was further designed to update the attribute matrix and enhanced adjacency matrix dynamically during iteration, thereby enabling co-optimization of attribute completion and clustering tasks. Experimental results show that AMGC-SJO outperforms AMGC-MF on multiple clustering metrics, with better key metrics on five datasets. Compared to Attribute-Missing Graph Clustering (AMGC), the proposed model achieves comparable clustering accuracy while reducing running time by at least 89.57% under the topological centrality-based missing mechanism. Furthermore, on the Cora dataset and attribute privacy missing mechanism, when the missing rate is increased from 10% to 90%, the clustering metrics of AMGC-SJO fluctuate within 2.08 percentage points, demonstrating strong robustness, whereas those of AMGC decline by over 30.88 percentage points. It can be seen that the proposed model provides an accurate, efficient, and robust solution for attribute-missing graph clustering.

Key words: attribute-missing graph, clustering, Non-negative Matrix Factorization (NMF), graph regularization, attribute completion

摘要:

针对属性缺失图聚类中属性补全和聚类两阶段方法的目标不一致及深度学习方法效率低的问题,提出一种基于堆叠式联合优化的属性缺失图聚类模型(AMGC-SJO)。首先,构建基于矩阵分解的属性缺失图聚类模型(AMGC-MF),通过增强邻接矩阵刻画节点间的全局连接关系,并借助图正则化实现属性补全,进而对补全后的属性矩阵与增强邻接矩阵进行联合非负矩阵分解(NMF),以学习节点聚类的隶属度。在此基础上,进一步设计AMGC-SJO,在迭代优化中动态更新属性矩阵与增强邻接矩阵,从而实现属性补全与聚类任务的协同优化。实验结果表明,AMGC-SJO的多项聚类评估指标显著优于AMGC-MF,在5个数据集上都取得了更优结果;与AMGC(Attribute-Missing Graph Clustering)相比,所提模型在保持相当聚类精度的同时,运行时间在拓扑中心性缺失机制下至少缩短了89.57%。此外,在Cora数据集和属性隐私缺失机制下,当缺失率从10%升至90%时,AMGC-SJO的聚类评估指标波动不超过2.08个百分点,表现出良好的鲁棒性,而AMGC则下降了超过30.88个百分点。可见,所提模型为属性缺失图聚类提供了一种高精度、高效率且强鲁棒的解决方案。

关键词: 属性缺失图, 聚类, 非负矩阵分解, 图正则, 属性补全

CLC Number: