Open Access iconOpen Access

ARTICLE

Unmasking Social Robots’ Camouflage: A GNN-Random Forest Framework for Enhanced Detection

by Weijian Fan1,*, Chunhua Wang2, Xiao Han3, Chichen Lin4

1 School of Data Science and Intelligent Media, Communication University of China, Beijing, 100024, China
2 School of Computer and Cyber Sciences, Communication University of China, Beijing, 100024, China
3 Institute of Communication Studies, Communication University of China, Beijing, 100024, China
4 State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing, 100024, China

* Corresponding Author: Weijian Fan. Email: email

Computers, Materials & Continua 2025, 82(1), 467-483. https://doi.org/10.32604/cmc.2024.056930

Abstract

The proliferation of robot accounts on social media platforms has posed a significant negative impact, necessitating robust measures to counter network anomalies and safeguard content integrity. Social robot detection has emerged as a pivotal yet intricate task, aimed at mitigating the dissemination of misleading information. While graph-based approaches have attained remarkable performance in this realm, they grapple with a fundamental limitation: the homogeneity assumption in graph convolution allows social robots to stealthily evade detection by mingling with genuine human profiles. To unravel this challenge and thwart the camouflage tactics, this work proposed an innovative social robot detection framework based on enhanced HOmogeneity and Random Forest (HORFBot). At the core of HORFBot lies a homogeneous graph enhancement strategy, intricately woven with edge-removal techniques, to meticulously dissect the graph into multiple revealing subgraphs. Subsequently, leveraging the power of contrastive learning, the proposed methodology meticulously trains multiple graph convolutional networks, each honed to discern nuances within these tailored subgraphs. The culminating stage involves the fusion of these feature-rich base classifiers, harmoniously aggregating their insights to produce a comprehensive detection outcome. Extensive experiments on three social robot detection datasets have shown that this method effectively improves the accuracy of social robot detection and outperforms comparative methods.

Keywords


Cite This Article

APA Style
Fan, W., Wang, C., Han, X., Lin, C. (2025). Unmasking social robots’ camouflage: A gnn-random forest framework for enhanced detection. Computers, Materials & Continua, 82(1), 467-483. https://doi.org/10.32604/cmc.2024.056930
Vancouver Style
Fan W, Wang C, Han X, Lin C. Unmasking social robots’ camouflage: A gnn-random forest framework for enhanced detection. Comput Mater Contin. 2025;82(1):467-483 https://doi.org/10.32604/cmc.2024.056930
IEEE Style
W. Fan, C. Wang, X. Han, and C. Lin, “Unmasking Social Robots’ Camouflage: A GNN-Random Forest Framework for Enhanced Detection,” Comput. Mater. Contin., vol. 82, no. 1, pp. 467-483, 2025. https://doi.org/10.32604/cmc.2024.056930



cc Copyright © 2025 The Author(s). Published by Tech Science Press.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 340

    View

  • 82

    Download

  • 0

    Like

Share Link