arrow
返回

Deep neighbor-aware embedding for node clustering in attributed graphs

delete2022-02-01
delete45
PRE
AI
C
Chun Wang
Shirui Pan 封面图
Shirui Pan (Shirui Pan) *
C
Celina P. Yu
R
Ruiqi Hu
G
Guodong Long
张
张承启 (Chengqi Zhang)
DOI:10.1016/j.patcog.2021.108230delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Node clustering aims to partition the vertices in a graph into multiple groups or communities. Existing studies have mostly focused on developing deep learning approaches to learn a latent representation of nodes, based on which simple clustering methods like k-means are applied. These two-step frameworks for node clustering are difficult to manipulate and usually lead to suboptimal performance, mainly because the graph embedding is not goal-directed, i.e., designed for the specific clustering task. In this paper, we propose a clustering-directed deep learning approach, Deep Neighbor-aware Embedded Node Clustering (DNENC for short) for clustering graph data. Our method focuses on attributed graphs to sufficiently explore the two sides of information in graphs. It encodes the topological structure and node content in a graph into a compact representation via a neighbor-aware graph autoencoder, which progressively absorbs information from neighbors via a convolutional or attentional encoder. Multiple neighbor aware encoders are stacked to build a deep architecture followed by an inner-product decoder for reconstructing the graph structure. Furthermore, soft labels are generated to supervise a self-training process, which iteratively refines the node clustering results. The self-training process is jointly learned and optimized with the graph embedding in a unified framework, to benefit both components mutually. Experimental results compared with state-of-the-art algorithms demonstrate the good performance of our framework. (C) 2021 Elsevier Ltd. All rights reserved.
Keyword:
Attributed graph
Node clustering
Graph attention network
Graph convolutional network
Network representation

期刊

Pattern Recognition 封面图
Pattern Recognition
IF:
7.6
论文数:
1.3W
被引数:
4.5W

机构

M
Monash University
学者数:
5.4W
论文数: 5.4W
被引数: 79
U
university of technology sydney
学者数:
1.6W
论文数: 2.0W
被引数: 25
引用论文

引用论文

Community discovery in networks with deep sparse filtering
err2018-09-01
err44
PREAI
errXie, Yu; Gong, Maoguo; Wang, Shanfeng; Yu, Bin
err分享
err收藏
err分享
err收藏
Overlapping community detection in rating-based social networks through analyzing topics, ratings and links
err2018-09-01
err18
PREAI
errReihanian, Ali; Feizi-Derakhshi, Mohammad-Reza; Aghdasi, Hadi S.
err分享
err收藏
没有更多内容