Stackelberg games for adversarial prediction problems
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Protecting location privacy: optimal strategy against localization attacks
Proceedings of the 2012 ACM conference on Computer and communications security
An efficient adversarial learning strategy for constructing robust classification boundaries
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
It is now widely accepted that in many situations where classifiers are deployed, adversaries deliberately manipulate data in order to reduce the classifier’s accuracy. The most prominent example is email spam, where spammers routinely modify emails to get past classifier-based spam filters. In this paper we model the interaction between the adversary and the data miner as a two-person sequential noncooperative Stackelberg game and analyze the outcomes when there is a natural leader and a follower. We then proceed to model the interaction (both discrete and continuous) as an optimization problem and note that even solving linear Stackelberg game is NP-Hard. Finally we use a real spam email data set and evaluate the performance of local search algorithm under different strategy spaces.