Robust Community Detection in Attribute Networks

Identifying community structures is vital in analysing and understanding the functions of complex networks. Topological information is widely used in most existing community detection algorithms; however, it is important to simultaneously consider the available node attribute information to capture the deeper knowledge of the intrinsic community structure of networks, which has been largely ignored by previous methods. In this work, we integrate network topological information and node attribute information uniformly in a novel \({\ell }_{2,1}\)-norm nonnegative matrix factorization (NMF)-based model with network regularization. Specifically, we employ the \({\ell }_{2,1}\)-norm NMF to alleviate noise that exists in the node attributes, and incorporate a network regularization term into our framework to encode the network geometrical information. Accordingly, the new representations in the latent node space share the information encoded consistently in both the network structure and node attributes; giving the new representations greater discriminatory power. Our experimental results on six real-world networks demonstrate the competitive performance of the proposed method compared to the state-of-the-art approaches.

Authors

Institutions

Publication Details

Published
2025-03-28
DOI
https://doi.org/10.1145/3745238.3745521
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Robust Community Detection in Attribute Networks

Xuelong Jiang, Zhuanlian Ding, Xi Hu
Complex Network Analysis Techniques
article

Robust Community Detection in Attribute Networks

Xuelong Jiang, Zhuanlian Ding, Xi Hu
article en

Abstract

Identifying community structures is vital in analysing and understanding the functions of complex networks. Topological information is widely used in most existing community detection algorithms; however, it is important to simultaneously consider the available node attribute information to capture the deeper knowledge of the intrinsic community structure of networks, which has been largely ignored by previous methods. In this work, we integrate network topological information and node attribute information uniformly in a novel \({\ell }_{2,1}\)-norm nonnegative matrix factorization (NMF)-based model with network regularization. Specifically, we employ the \({\ell }_{2,1}\)-norm NMF to alleviate noise that exists in the node attributes, and incorporate a network regularization term into our framework to encode the network geometrical information. Accordingly, the new representations in the latent node space share the information encoded consistently in both the network structure and node attributes; giving the new representations greater discriminatory power. Our experimental results on six real-world networks demonstrate the competitive performance of the proposed method compared to the state-of-the-art approaches.

Anhui University (CN)
National Science Foundation, National Natural Science Foundation of China, Natural Science Foundation of Anhui Province
Reduced inequalities
Openalex Percentile: Top 85%
Complex Network Analysis Techniques
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.