Signed Latent Factors for Spamming Activity Detection
Yuli Liu

TL;DR
This paper introduces signed latent factors and two algorithms to improve spam detection on online platforms, effectively handling data imbalance and incompleteness, and outperforming existing methods.
Contribution
It proposes a novel signed latent factor approach with two algorithms for spam detection, addressing long-standing challenges like class imbalance and graph incompleteness.
Findings
LFM models outperform state-of-the-art baselines
Effective in handling incomplete data
Robust against class imbalance
Abstract
Due to the increasing trend of performing spamming activities (e.g., Web spam, deceptive reviews, fake followers, etc.) on various online platforms to gain undeserved benefits, spam detection has emerged as a hot research issue. Previous attempts to combat spam mainly employ features related to metadata, user behaviors, or relational ties. These studies have made considerable progress in understanding and filtering spamming campaigns. However, this problem remains far from fully solved. Almost all the proposed features focus on a limited number of observed attributes or explainable phenomena, making it difficult for existing methods to achieve further improvement. To broaden the vision about solving the spam problem and address long-standing challenges (class imbalance and graph incompleteness) in the spam detection area, we propose a new attempt of utilizing signed latent factors to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSpam and Phishing Detection · Sentiment Analysis and Opinion Mining · Text and Document Classification Technologies
