A Game Model for Adversarial Classification in Spam Filtering

Article Preview

Abstract:

With the wide applications of machine learning techniques in spam filtering, malicious adversaries have been increasingly launching attacks against the filtering systems. In this paper, we model the interaction between the data miner and the adversary as Stackelberg games. Though existing algorithms for Stackelberg games efficiently find optimal solutions, they critically assume the follower plays optimally and rationally. Unfortunately, in real-world applications, because of follower's bounded rationality and limited observation of the leader's strategy, it may deviate from their expected optimal response. Considering this crucial problem, this paper solve for the Nash equilibrium. Experiments on real spam dataset demonstrate that bounded rationality and limited observation can make Stackelberg games more practical and provide interesting insights about the interaction between the data miner and the spammer in spam filtering.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 433-440)

Pages:

5053-5057

Citation:

Online since:

January 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] N. Dalvi, P. Mausam Domingos, S. Sanghai and D. Verma, in: KDD'04, New York: ACM (2004), p.99–108.

Google Scholar

[2] D. Lowd, C. Meek, in: KDD'05, New York: ACM (2005), p.641–647.

Google Scholar

[3] M. Kantarcioglu, B. Xi and C. Clifton: Technical report, Department of Statistics, Purdue University (2009).

Google Scholar

[4] W. Liu, S. Chawla, in: ICDM'09 workshops. Los Alamitos, IEEE Computer Society (2009), p.25–30.

Google Scholar

[5] W. Liu, S. Chawla: Machine Learning, 81 (2010), p.69–83.

Google Scholar

[6] C. Lin, R. Weng and S. Keerthi: Journal of Machine Learning Research, 9 (2008), p.627–650.

Google Scholar

[7] S. J. Delany, P. Cunningham, A. Tsymbal and L. Coyle: Knowledge-Based Systems, 18, 4–5 (2005), p.187–195.

DOI: 10.1016/j.knosys.2004.10.002

Google Scholar

[8] I. Witten, E. Frank: ACM SIGMOD Record, 31, 1 (2002), p.76–77.

Google Scholar

[9] R. Byrd, R. Schnabel and G. Shultz: Mathematical Programming, 40, 1 (1988), p.247–263.

Google Scholar

[10] J. Moré, D. Sorensen: SIAM Journal on Scientific and Statistical Computing, 4, 553 (1983).

Google Scholar

[11] T. Steihaug: SIAM Journal on Numerical Analysis, 20, 3 (1983), p.626–637.

Google Scholar