Multi Resolution based Graph Convolutional Networks for Detecting Communities in Social Networks

Detecting the fundamental community structure of a social network is crucial in social network analysis. All though, there are many recent approaches in detecting communities, analysing large scale social networks at all resolutions is a challenging task. To solve this problem, the proposed research focuses on developing an efficient Multi Resolution-Graph Convolutional Network (MR-GCN) to identify the communities in social networks. The proposed method with the graph mining technique improves the output graph quality in identifying the communities. The conventional approaches depend on the labelled data, which is limited data in the real time applications. Initially, the nodes of raw graph are converted into embeddings and are further processed by multiple layers of a GCN to incorporate both the local and global structural features. The MR feature fusion is used to combine node embeddings from different resolutions, which includes all necessary information. The final phase includes Adam optimizer to train the model, and the overall experimental results obtained are accuracy of 97.85%, precision of 96.57%, and f1-score of 95.77%. The proposed method results are compared with the existing methods such as Graph Neural Network encoding scheme for a Multi-Objective Evolutionary Algorithm (GNN-MOEA) and Markov Random Fields GCN (MRFasGCN).

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1109/iacis61494.2024.10721782
Citations
1
Primary Topic
Complex Network Analysis Techniques
Type
article
Field-Weighted Citation Impact
0.28
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi Resolution based Graph Convolutional Networks for Detecting Communities in Social Networks

Debarshi Mazumder, P.S.C. Sri Harsha, Y. Nagendar, Zainab abed Almoussawi et al.
1 citations
Complex Network Analysis Techniques
0.28
article

Multi Resolution based Graph Convolutional Networks for Detecting Communities in Social Networks

Debarshi Mazumder, P.S.C. Sri Harsha, Y. Nagendar, Zainab abed Almoussawi, Saif Obaid
article en
1 citations

Abstract

Detecting the fundamental community structure of a social network is crucial in social network analysis. All though, there are many recent approaches in detecting communities, analysing large scale social networks at all resolutions is a challenging task. To solve this problem, the proposed research focuses on developing an efficient Multi Resolution-Graph Convolutional Network (MR-GCN) to identify the communities in social networks. The proposed method with the graph mining technique improves the output graph quality in identifying the communities. The conventional approaches depend on the labelled data, which is limited data in the real time applications. Initially, the nodes of raw graph are converted into embeddings and are further processed by multiple layers of a GCN to incorporate both the local and global structural features. The MR feature fusion is used to combine node embeddings from different resolutions, which includes all necessary information. The final phase includes Adam optimizer to train the model, and the overall experimental results obtained are accuracy of 97.85%, precision of 96.57%, and f1-score of 95.77%. The proposed method results are compared with the existing methods such as Graph Neural Network encoding scheme for a Multi-Objective Evolutionary Algorithm (GNN-MOEA) and Markov Random Fields GCN (MRFasGCN).

Ahl Al Bayt University (IQ), Iraqi University (IQ)
Reduced inequalities
Openalex Percentile: Top 44%
Complex Network Analysis Techniques
0.28
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.