Retracted: Spam Detection for Social Media Networks Using Machine Learning
Post-publication record
OpenAlex flags this work as retracted, but it carries no matching Retraction Watch record in this frame.
Bibliographic record
Abstract
People frequently examine internet product reviews before purchasing a product. More merchants aim to deceive users in order to earn a profit. Because customers are misled in this way, it's critical to be aware of and delete fraudulent reviews. This study examines machine learning-based spam detection approaches and discusses their general perspectives and outcomes. Knowing how important customer reviews are to a product's success, marketers frequently try to fool customers by publishing phoney remarks. Merchants have the option of posting updates themselves or hiring others to do so for them. Comment or review spam is the practice of sending out false updates. Spam senders might be recruited to leave favorable or negative reviews that harm competitor business. By 2020, the Canadian Competition Bureau gave a warning to its citizens officially, stating that they should be careful of fraudulent reviews and estimating that one off three of online reviews is fake. Poll fiction taken from more than twenty-five thousand participants by 2020 claims that more than seventy percent of consumers trust online reviews. As a result, spam reviews are a major source of concern nowadays. Based on the goal of the proposed techniques, the majority of the published articles dealing with this subject can be segregated into three. Tactics can be used to get spam reviews, individual spam senders, or spams sent by groups. Because the spam sent in group methods haven't been thoroughly investigated; they aren't discussed in this work. Spam detection is a machine learning issue that requires supervision. This means you'll need to give your machine learning model a set of spam and ham message examples and tell it to look for the relevant patterns that distinguish the two groups. Most email service providers have large databases of labelled emails.
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.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.005 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".