聚类分析
图形
符号
计算机科学
聚类系数
电压图
图形属性
折线图
理论计算机科学
数学
人工智能
算术
作者
Xiaotong Zhang,Han Liu,Qimai Li,Xiao-Ming Wu,Xianchao Zhang
出处
期刊:IEEE Transactions on Knowledge and Data Engineering
[Institute of Electrical and Electronics Engineers]
日期:2023-12-01
卷期号:35 (12): 12384-12399
标识
DOI:10.1109/tkde.2023.3278721
摘要
Attributed graph clustering is a challenging task as it requires to jointly model graph structure and node attributes. Although recent advances in graph convolutional networks have shown the effectiveness of graph convolution in combining structural and content information, there is limited understanding of how to properly apply it for attributed graph clustering. Previous methods commonly use a fixed and low order graph convolution, which only aggregates information of few-hop neighbours and hence cannot fully capture the cluster structures of diverse graphs. In this paper, we first propose an adaptive graph convolution method (AGC) for attributed graph clustering, which exploits high-order graph convolutions to capture global cluster structures and adaptively selects an appropriate order $k$ via intra-cluster distance. While AGC can find a reasonable $k$ and avoid over-smoothing, it is not sensitive to the gradual decline of clustering performance as $k$ increases. To search for a better $k$ , we further propose an improved adaptive graph convolution method (IAGC) that not only observes the variation of intra-cluster distance, but also considers the inconsistencies of filtered features with graph structure and raw features, respectively. We establish the validity of our methods by theoretical analysis and extensive experiments on various benchmark datasets.
科研通智能强力驱动
Strongly Powered by AbleSci AI