Cited by 6Spam and Phishing DetectionMisinformation and Its ImpactsHate Speech and Cyberbullying Detection

Uncovering Malicious Accounts in Online Social Networks Using XGBoost and Graph Convolution Networks

Tang, Yuting, Zhang, Dafang, Li, Kuan-Ching, Yuan, Junsong·2025·IEEE Transactions on Consumer Electronics

Abstract

In this work, we introduce a Machine-Learning (ML) approach based on XGBoost and Graph Convolutional Networks (GCNs) for the detection of active malicious accounts in Online Social Networks (OSN). Distinguishing itself from previous detection algorithms by relying on user relationships, our approach combines heterogeneous information, including descriptive user features and inter-user relationship data, to obtain advanced user representations for determining their legitimacy. Specifically, we employ the XGBoost algorithm to extract crucial features, mitigating the impact of redundant ones. Next, we utilize the Graph Convolutional Networks approach to derive advanced user representations based on the actual relationships between malicious accounts and the descriptive features of users, and lastly, we employ the sigmoid function to assess user legitimacy based on their high-level feature matrices. Experimental results depict that the proposed XGBoost-based approach outperforms other feature selection methods, and comparison with other account detection algorithms shows superior efficiency, accuracy, and flexibility.

Integrity signals

Registry

Crossref · 10.1109/tce.2024.3406194

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Experiments based on Random Forest and XGBoost classifiers have proven to perform well in dealing with structured data.

    “Experiments based on RF and XGBoost (XGB)55 classifiers have proven to perform well in dealing with structured data.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Tang, Y., Zhang, D., Li, K.-C., & Yuan, J.
Affiliations
  • Hunan University (CN)
  • Providence University (TW)
  • University at Buffalo, State University of New York (US)
Venue
IEEE Transactions on Consumer Electronics
Published
2025-05
Volume
71
Issue
2
Pages
6489-6498
ISSN
  • 0098-3063 (ISSN-L)
  • 1558-4127
OpenAlex
W4399039675
Cited by
6
References
39
Citations by year
2026: 2 · 2025: 3 · 2024: 1
FWCI
2.26
Type
journal article
Language
en
Open access
closed
Locations
IEEE Transactions on Consumer Electronics (publishedVersion)
Funders
National Natural Science Foundation of China (62072170, 61872138)
Topics
  • Physical Sciences › Computer Science › Information Systems › Spam and Phishing Detection
  • Social Sciences › Sociology and Political Science › Misinformation and Its Impacts
  • Physical Sciences › Computer Science › Artificial Intelligence › Hate Speech and Cyberbullying Detection
Keywords
malicious account detection, social networking sites, XGBoost, graph convolutional networks, feature selection, user representation learning

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review