CGAF: Community-Guided Attentive Fusion for Community Detection in Multiplex Networks

Community detection in multiplex networks seeks groups of nodes from several types of relations. Attention mechanisms can integrate these relations, but weights based on embedding compatibility do not explicitly measure the community support provided by a node’s neighborhood. We propose Community-Guided Attentive Fusion (CGAF), an end-to-end graph neural network framework that uses neighborhood community evidence to guide relation fusion. Graph contrastive learning encodes refined relation graphs and a learned fused graph to capture relation-specific and shared information. Shared prototypes produce provisional soft memberships, which are used to calculate degree-corrected neighborhood evidence. This evidence adjusts node-specific attention, and a learnable residual coefficient combines the relation embeddings with the fused-graph representation. The prototypes then assign communities to the resulting representations. Joint optimization with contrastive, self-training, and modularity objectives connects representation learning, relation weighting, and community assignment. On ACM, DBLP, and Yelp, CGAF achieves the highest observed means across four community detection metrics among eight comparison methods under the stated protocols. Ablation and parameter analyses show how community evidence, structural supervision, and residual fusion contribute to the learned partitions.

Authors

Institutions

Publication Details

Journal
Applied Sciences
Published
2026-10-16
DOI
https://doi.org/10.3390/app162010265
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

CGAF: Community-Guided Attentive Fusion for Community Detection in Multiplex Networks

Yuchen Liu, Hongchang Chen
Applied Sciences
Advanced Graph Neural Networks
article

CGAF: Community-Guided Attentive Fusion for Community Detection in Multiplex Networks

Yuchen Liu, Hongchang Chen
article en

Abstract

Community detection in multiplex networks seeks groups of nodes from several types of relations. Attention mechanisms can integrate these relations, but weights based on embedding compatibility do not explicitly measure the community support provided by a node’s neighborhood. We propose Community-Guided Attentive Fusion (CGAF), an end-to-end graph neural network framework that uses neighborhood community evidence to guide relation fusion. Graph contrastive learning encodes refined relation graphs and a learned fused graph to capture relation-specific and shared information. Shared prototypes produce provisional soft memberships, which are used to calculate degree-corrected neighborhood evidence. This evidence adjusts node-specific attention, and a learnable residual coefficient combines the relation embeddings with the fused-graph representation. The prototypes then assign communities to the resulting representations. Joint optimization with contrastive, self-training, and modularity objectives connects representation learning, relation weighting, and community assignment. On ACM, DBLP, and Yelp, CGAF achieves the highest observed means across four community detection metrics among eight comparison methods under the stated protocols. Ablation and parameter analyses show how community evidence, structural supervision, and residual fusion contribute to the learned partitions.

Applied SciencesVol. 16(20)
PLA Information Engineering University (CN)
Openalex Percentile: Top 13%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.