ACM Home Page
Please provide us with feedback. Feedback
Adversarial learning
Full text PdfPdf (774 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining table of contents
Chicago, Illinois, USA
POSTER SESSION: Research track poster table of contents
Pages: 641 - 647  
Year of Publication: 2005
ISBN:1-59593-135-X
Authors
Daniel Lowd  University of Washington - Seattle, Seattle, WA
Christopher Meek  Microsoft Research, Redmond, WA
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 70,   Citation Count: 7
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1081870.1081950
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
D. Lowd and C. Meek. Good word attacks on statistical spam filters. In Proceedings of the Second Conference on Email and Anti-Spam, Palo Alto, CA, 2005.
 
4
M. Sahami, S. Dumais, D. Heckerman, and E. Horvitz. A Bayesian approach to filtering junk E-mail. In Learning for Text Categorization: Papers from the 1998 Workshop, Madison, Wisconsin, 1998. AAAI Technical Report WS-98-05.
 
5
S. Tzu. The art of war, 500bc.
6
 
7
L. Zhang and T. Yao. Filtering junk mail with a maximum entropy model. In ICCPOL2003, pages 446--453, ShenYang, China, 2003.

CITED BY  7

Collaborative Colleagues:
Daniel Lowd: colleagues
Christopher Meek: colleagues