mlsanityData to 7 Oct 2026

Botcha: Detecting Malicious Non-Human Traffic in the Wild

arXiv 2103.01428 ↗First posted 2 Mar 2021cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Malicious bots make up about a quarter of all traffic on the web, and degrade the performance of personalization and recommendation algorithms that operate on e-commerce sites. Positive-Unlabeled learning (PU learning) provides the ability to train a binary classifier using only positive (P) and unlabeled (U) instances. The unlabeled data comprises of both positive and negative classes. It is possible to find labels for strict subsets of non-malicious actors, e.g., the assumption that only humans purchase during web sessions, or clear CAPTCHAs. However, finding signals of malicious behavior is almost impossible due to the ever-evolving and adversarial nature of bots. Such a set-up naturally lends itself to PU learning. Unfortunately, standard PU learning approaches assume that the labeled set of positives are a random sample of all positives, this is unlikely to hold in practice. In this work, we propose two modifications to PU learning that make it more robust to violations of the selected-completely-at-random assumption, leading to a system that can filter out malicious bots. In one public and one proprietary dataset, we show that proposed approaches are better at identifying humans in web data than standard PU learning methods.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 4 of its 16 references that are in the map. First posted on arXiv 2 Mar 2021.

Builds on

4 of 16 references.

References · 4

  1. 2018Learning from positive and unlabeled data: a surveycited by 218
  2. 2018Adversarial Personalized Ranking for Recommendationcited by 48
  3. 2018Beyond the Selected Completely At Random Assumption for Learning from Positive and Unlabeled Datacited by 36
  4. 2015In a World That Counts: Clustering and Detecting Fake Social Engagement at Scalecited by 8

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.