|
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
| Volume 187 - Issue 89 |
| Published: March 2026 |
| Authors: Heta Dasondi, Meghna B. Patel, Satyen M. Parikh |
10.5120/ijca2026926566
|
Heta Dasondi, Meghna B. Patel, Satyen M. Parikh . Graph Convolutional Representation Learning for Sybil Detection in Online Social Networks. International Journal of Computer Applications. 187, 89 (March 2026), 53-58. DOI=10.5120/ijca2026926566
@article{ 10.5120/ijca2026926566,
author = { Heta Dasondi,Meghna B. Patel,Satyen M. Parikh },
title = { Graph Convolutional Representation Learning for Sybil Detection in Online Social Networks },
journal = { International Journal of Computer Applications },
year = { 2026 },
volume = { 187 },
number = { 89 },
pages = { 53-58 },
doi = { 10.5120/ijca2026926566 },
publisher = { Foundation of Computer Science (FCS), NY, USA }
}
%0 Journal Article
%D 2026
%A Heta Dasondi
%A Meghna B. Patel
%A Satyen M. Parikh
%T Graph Convolutional Representation Learning for Sybil Detection in Online Social Networks%T
%J International Journal of Computer Applications
%V 187
%N 89
%P 53-58
%R 10.5120/ijca2026926566
%I Foundation of Computer Science (FCS), NY, USA
Online Social Networks (OSNs) are increasingly vulnerable to Sybil attacks, wherein adversaries create numerous fake identities to distort information, manipulate influence, and compromise user trust. Existing detection methods, while effective in constrained settings, often struggle to scale and generalize across the complex and dynamic topologies of modern social graphs. In this paper, it propose SD-GCN, a scalable Sybil detection framework based on Graph Convolutional Networks. The proposed method leverages a GCN architecture that integrates both local and global topological features through multi-hop message passing, enabling the extraction of expressive node embeddings that capture structural and behavioral distinctions between benign and Sybil nodes. To enhance performance, the model undergoes comprehensive hyper-parameter optimization, balancing detection accuracy with computational efficiency. The proposed approach is evaluated on a real-world Facebook follower-followee graph and achieves a high classification performance, significantly outperforming established baselines such as SybilGAT and SybilWalk. Notably, the model achieves an Area Under the Curve (AUC) of 96%, demonstrating its robustness and generalization capability for large-scale OSN environments.