arrow
Return

Deep cut-informed graph embedding and clustering

delete2025-08-10
delete0
PRE
AI
Z
Zhiyuan Ning
Z
Z. Wang
R
Ran Zhang
P
Ping Xu
K
Kunpeng Liu
P
Pengyang Wang
W
Wei Ju
P
Pengfei Wang *
Y
Yuanchun Zhou
E
Erik Cambria
C
Chong Chen
DOI:10.1016/j.inffus.2025.103603delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
• Investigate graph clustering from a graph cut perspective. • Proposing a novel and non-GNN-based graph clustering paradigm, DCGC. • A cut-informed graph encoding module to fuse graph structure and node attributes. • Self-supervised graph clustering via optimal transport.
Keywords:
graph clustering
graph cut
non-GNN-based
cut-informed encoding
optimal transport

Journal

Information Fusion cover
Information Fusion
IF:
15.5
Papers:
4.1K
Citations:
2.7W

Organization

F
future city lab
Scholars:
1
Papers: 1
Citations: 0
P
Portland State University
Scholars:
3.3K
Papers: 3.3K
Citations: 5.0K
N
Nanyang Technological University
Scholars:
4.9W
Papers: 4.8W
Citations: 8.1W
C
Computer Network Information Center
Scholars:
70
Papers: 34
Citations: 581
S
sichuan university
Scholars:
11.9W
Papers: 7.7W
Citations: 100
U
University of Macau
Scholars:
1.1W
Papers: 1.3W
Citations: 2.0W
researcher View more organizations