REVIEW 2 cited by
MGTAB: A Multi-Relational Graph-Based Twitter Account Detection Benchmark
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The development of social media user stance detection and bot detection methods rely heavily on large-scale and high-quality benchmarks. However, in addition to low annotation quality, existing benchmarks generally have incomplete user relationships, suppressing graph-based account detection research. To address these issues, we propose a Multi-Relational Graph-Based Twitter Account Detection Benchmark (MGTAB), the first standardized graph-based benchmark for account detection. To our knowledge, MGTAB was built based on the largest original data in the field, with over 1.55 million users and 130 million tweets. MGTAB contains 10,199 expert-annotated users and 7 types of relationships, ensuring high-quality annotation and diversified relations. In MGTAB, we extracted the 20 user property features with the greatest information gain and user tweet features as the user features. In addition, we performed a thorough evaluation of MGTAB and other public datasets. Our experiments found that graph-based approaches are generally more effective than feature-based approaches and perform better when introducing multiple relations. By analyzing experiment results, we identify effective approaches for account detection and provide potential future research directions in this field. Our benchmark and standardized evaluation procedures are freely available at: https://github.com/GraphDetec/MGTAB.
Forward citations
Cited by 2 Pith papers
-
Towards Propagation-aware Representation Learning for Supervised Social Media Graph Analytics
A single graph-representation framework with a kinetic-model loss beats task-specific baselines on rumor, bot, and cascade tasks and transfers across datasets.
-
Boosting Bot Detection via Heterophily-Aware Representation Learning and Prototype-Guided Cluster Discovery
BotHP combines a dual-encoder (graph and MLP) with prototype-guided clustering to pre-train graph bot detectors, improving F1 by 1.3-6.0 points on TwiBot-20 and MGTAB.
Discussion (0). Continue with ORCID to comment.