Enhancing NMF-Based Community Detection via A Higher-Order Proximity-Incorporated Graph Attention Autoencoder

Community detection reveals the organizational patterns of complex networks. With good interpretability, non-negative matrix factorization (NMF) approaches are often used for this task. However, their linearity limits the performance of community detection on networks with complex, sparse, and diverse structures. As graph neural networks (GNNs) have strong nonlinear representation power, combining NMF with GNNs can overcome this limitation. However, a GNN model generally faces the issue of over-smoothing and struggles to explicitly use higher-order proximity (HOP) among nodes. To address this issue, this paper proposes HNG, a HOP-enhanced nonlinear NMF approach for community detection, with three modules: HOP-incorporated network enhancement, graph attention autoencoder (GAAE), and NMF. It first leverages HOP explicitly to better characterize the community structure for the facility of community detection, and then applies a nonlinear NMF improved via a GAAE for accurate community detection. Experimental results on six real networks show that HNG significantly outperforms state-of-the-art methods in achieving community detection accuracy gain.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1109/acai63924.2024.10899563
Citations
1
Primary Topic
Text and Document Classification Technologies
Type
article
Field-Weighted Citation Impact
0.35

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancing NMF-Based Community Detection via A Higher-Order Proximity-Incorporated Graph Attention Autoencoder

Zhigang Liu, Yurong Zhong, Hao Yan, Weiling Li
1 citations
Text and Document Classification Technologies
0.35
article

Enhancing NMF-Based Community Detection via A Higher-Order Proximity-Incorporated Graph Attention Autoencoder

Zhigang Liu, Yurong Zhong, Hao Yan, Weiling Li
article en
1 citations

Abstract

Community detection reveals the organizational patterns of complex networks. With good interpretability, non-negative matrix factorization (NMF) approaches are often used for this task. However, their linearity limits the performance of community detection on networks with complex, sparse, and diverse structures. As graph neural networks (GNNs) have strong nonlinear representation power, combining NMF with GNNs can overcome this limitation. However, a GNN model generally faces the issue of over-smoothing and struggles to explicitly use higher-order proximity (HOP) among nodes. To address this issue, this paper proposes HNG, a HOP-enhanced nonlinear NMF approach for community detection, with three modules: HOP-incorporated network enhancement, graph attention autoencoder (GAAE), and NMF. It first leverages HOP explicitly to better characterize the community structure for the facility of community detection, and then applies a nonlinear NMF improved via a GAAE for accurate community detection. Experimental results on six real networks show that HNG significantly outperforms state-of-the-art methods in achieving community detection accuracy gain.

Dongguan University of Technology (CN)
Research Promotion Foundation
Reduced inequalities
Openalex Percentile: Top 29%
Text and Document Classification Technologies
0.35
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.

Enhancing NMF-Based Community Detection via A Higher-Order Proximity-Incorporated Graph Attention Autoencoder — Zhigang Liu, Yurong Zhong, et al. · (2024) | TGRS Research Map | TGRS