Temporal Knowledge Consistency for Spammer Groups Detection via Contrastive Learning

Online reviews on platforms such as Amazon and Yelp significantly influence consumer decisions and business reputations. However, spammers form groups that strategically control product reviews over specific periods to manipulate consumer sentiment and decision-making. Traditional spammer group detection methods face two primary issues: 1) knowledge marginalization: interactions dominate the model to form candidate groups, potentially marginalizing valuable structured knowledge; and 2) temporal knowledge discrepancy: inconsistencies in users’ temporal activities and behavioral features lead to blurry classification of candidate groups. To address these two limitations, we introduce <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">temporal knowledge consistency for spammer groups detection via contrastive learning</i> called TKCCL. We employ dual-view encoders derived from knowledge graphs and heterogeneous information networks to learn informative representations, thereby alleviating knowledge marginalization. TKCCL maps the temporal knowledge as vectors to measure consistency, enhancing users’ rating proximity and temporal synchronization in dual views, thereby reducing temporal knowledge discrepancies. We optimize spammer group detection by modeling it as a greedy set cover problem, which enhances the method’s responsiveness to dynamic spam strategies. Experimental results on four public datasets demonstrate that TKCCL substantially outperforms existing methods. Our code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/NeenLee/TKCCL</uri>.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Computational Social Systems
Published
2025-08-25
DOI
https://doi.org/10.1109/tcss.2025.3592663
Citations
1
Primary Topic
Spam and Phishing Detection
Type
article
Field-Weighted Citation Impact
3.25
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Temporal Knowledge Consistency for Spammer Groups Detection via Contrastive Learning

Shujuan Ji, Yongquan Liang, Wenqi Fan, Shengda Zhuo et al.
1 citations
IEEE Transactions on Computational Social Systems
Spam and Phishing Detection
3.25
article

Temporal Knowledge Consistency for Spammer Groups Detection via Contrastive Learning

Shujuan Ji, Yongquan Liang, Wenqi Fan, Shengda Zhuo, Chaoqun Wang, Yuewei Zhou, Ning Li
article en
1 citations

Abstract

Online reviews on platforms such as Amazon and Yelp significantly influence consumer decisions and business reputations. However, spammers form groups that strategically control product reviews over specific periods to manipulate consumer sentiment and decision-making. Traditional spammer group detection methods face two primary issues: 1) knowledge marginalization: interactions dominate the model to form candidate groups, potentially marginalizing valuable structured knowledge; and 2) temporal knowledge discrepancy: inconsistencies in users’ temporal activities and behavioral features lead to blurry classification of candidate groups. To address these two limitations, we introduce <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">temporal knowledge consistency for spammer groups detection via contrastive learning</i> called TKCCL. We employ dual-view encoders derived from knowledge graphs and heterogeneous information networks to learn informative representations, thereby alleviating knowledge marginalization. TKCCL maps the temporal knowledge as vectors to measure consistency, enhancing users’ rating proximity and temporal synchronization in dual views, thereby reducing temporal knowledge discrepancies. We optimize spammer group detection by modeling it as a greedy set cover problem, which enhances the method’s responsiveness to dynamic spam strategies. Experimental results on four public datasets demonstrate that TKCCL substantially outperforms existing methods. Our code is available at <uri xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">https://github.com/NeenLee/TKCCL</uri>.

IEEE Transactions on Computational Social SystemsVol. 13(1)
Hong Kong Polytechnic University (HK), Jinan University (CN), Shandong University of Science and Technology (CN)
Reduced inequalities
Openalex Percentile: Top 7%
Spam and Phishing Detection
3.25
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.