PAPER DIGEST
Most Influential KDD 2005 Paper · 2026-03 edition

Adversarial Learning

Daniel Lowd; Christopher Meek

Venue
ACM SIGKDD Conference (KDD) 2005
Recognition
Most Influential KDD 2005 Paper (Rank No. 2)
Edition
2026-03
Impact factor
8
Certificate ID
46af5ac264850612

Abstract

Many classification tasks, such as spam filtering, intrusion detection, and terrorism detection, are complicated by an adversary who wishes to avoid detection. Previous work on adversarial classification has made the unrealistic assumption that the attacker has perfect knowledge of the classifier [2]. In this paper, we introduce the adversarial classifier reverse engineering (ACRE) learning problem, the task of learning sufficient information about a classifier to construct adversarial attacks. We present efficient algorithms for reverse engineering linear classifiers with either continuous or Boolean features and demonstrate their effectiveness using real data from the domain of spam filtering.

Download PDF certificate