GrFrauder: A Novel Unsupervised Clustering Algorithm for Identification Group Spam Reviewers
Bibliographic record
Abstract
As e-commerce has expanded, people's lives now include some aspect of online buying, because buyers frequently use online product reviews to make purchasing decisions.Merchants frequently collaborate with review spammers to write spam reviews that promote or demote selected items.Spammers who work in groups, in particular, are more dangerous than individual attacks.Previous studies provided various frequent item mining and graphbased techniques to detect such spammer groups.In this paper, we recommend a technique referred to as GrFrauder (Group Fraud detection) method to detect online spam reviewer groups with an unsupervised manner.Our technology identifies spammer candidate groups initially based on product -product review graph and collaboration among reviewers constructed with several behavioral patterns.It then embeds reviewers into an embedding space and calculates spam score for every group; with higher spam scores the model generates ranks for each group.Studies using four real-world datasets reveal that GrFrauder outperforms numerous state-of-the-art baselines in terms of precision and is able to identify more high-quality spammer groups.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.003 | 0.008 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.007 | 0.003 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.003 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.004 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".