A Filtered Gradient Descent Clustering Method to Recover Communities in Attributed Networks

An attributed network is a network in which in addition to the network structure each node is associated with a set of attributes. Community detection in such networks involves recovering the clusters by simultaneously using the network data and the node attributes. This research proposes a generic objective function and adopts the gradient descent (GD) approach to recover clusters in attributed networks. Our straightforward adoption of GD, even in its improved version, such as the adaptive moment estimation method, may encounter "bad sequences" of objects and converge to points that are far from optimal. To tackle this issue, we introduce a special "filter" mechanism, which culls potentially misleading objects. We established the theoretical foundation of the proposed filtering mechanism and the corresponding clustering method, and empirically evaluated and compared the performance of our proposed methods using synthetic and real-world datasets, including one new real-world dataset. Our results show that our proposed filter mechanism does improve results significantly and makes it competitive versus state-of-the-art algorithms.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3614989
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Filtered Gradient Descent Clustering Method to Recover Communities in Attributed Networks

Soroosh Shalileh
IEEE Access
Complex Network Analysis Techniques
article

A Filtered Gradient Descent Clustering Method to Recover Communities in Attributed Networks

Soroosh Shalileh
article en

Abstract

An attributed network is a network in which in addition to the network structure each node is associated with a set of attributes. Community detection in such networks involves recovering the clusters by simultaneously using the network data and the node attributes. This research proposes a generic objective function and adopts the gradient descent (GD) approach to recover clusters in attributed networks. Our straightforward adoption of GD, even in its improved version, such as the adaptive moment estimation method, may encounter "bad sequences" of objects and converge to points that are far from optimal. To tackle this issue, we introduce a special "filter" mechanism, which culls potentially misleading objects. We established the theoretical foundation of the proposed filtering mechanism and the corresponding clustering method, and empirically evaluated and compared the performance of our proposed methods using synthetic and real-world datasets, including one new real-world dataset. Our results show that our proposed filter mechanism does improve results significantly and makes it competitive versus state-of-the-art algorithms.

IEEE AccessVol. 13
Scientific Research Institute of the Rubber Industry (RU), Central Bank of the Russian Federation (RU)
Openalex Percentile: Top 79%
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.

A Filtered Gradient Descent Clustering Method to Recover Communities in Attributed Networks — Soroosh Shalileh · IEEE Access (2025) | TGRS Research Map | TGRS