Adversarial support vector machine learning

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2012, Pages 1059-1067

  Zhou, Yan ^a   Kantarcioglu, Murat ^a   Thuraisingham, Bhavani ^a   Xi, Bowei ^b  

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b PURDUE UNIVERSITY   (United States)

Author keywords

adversarial learning; attack models; robust SVM

Indexed keywords

ACTIVE ADVERSARY; ADVERSARIAL LEARNING; ATTACK MODEL; ATTACK STRATEGIES; CREDIT CARD FRAUD DETECTIONS; DATA CORRUPTION; LEARNING MODELS; LEARNING PROBLEM; LEARNING STRATEGY; LEARNING TASKS; OPTIMAL SOLUTIONS; REAL DATA SETS; ROBUST LEARNING; ROBUST SVM; SPAM FILTERING;

CRIME; DATA MINING; LEARNING ALGORITHMS; OPTIMIZATION;

SUPPORT VECTOR MACHINES;

EID: 84866042395     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339697     Document Type: Conference Paper

References (25)

1. LIBSVM Data: Classification, Regression, and Multi-label, 2012.
2. UCI Machine Learning Repository, 2012.
3. M. Barreno, B. Nelson, R. Sears, A. D. Joseph, and J. D. Tygar. Can machine learning be secure? In Proceedings of the 2006 ACM Symposium on Information, computer and communications security, pages 16-25, New York, NY, USA, 2006. ACM.
4. M. Bruckner and T. Scheffer. Nash equilibria of static prediction games. In Advances in Neural Information Processing Systems. MIT Press, 2009.
5. M. Bruckner and T. Scheffer. Stackelberg games for adversarial prediction problems. In Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 2011.
6. N. Dalvi, P. Domingos, Mausam, S. Sanghai, and D. Verma. Adversarial classification. In Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '04, pages 99-108, New York, NY, USA, 2004. ACM.
7. O. Dekel and O. Shamir. Learning to classify with missing and corrupted features. In Proceedings of the International Conference on Machine Learning, pages 216-223. ACM, 2008.
8. O. Dekel, O. Shamir, and L. Xiao. Learning to classify with missing and corrupted features. Machine Learning, 81(2):149-178, 2010.
9. L. El Ghaoui, G. R. G. Lanckriet, and G. Natsoulis. Robust classification with interval data. Technical Report UCB/CSD-03-1279, EECS Department, University of California, Berkeley, Oct 2003.
10. P. Fogla and W. Lee. Evading network anomaly detection systems: formal reasoning and practical techniques. In Proceedings of the 13th ACM conference on Computer and communications security, CCS '06, pages 59-68, New York, NY, USA, 2006. ACM.
11. A. Globerson and S. Roweis. Nightmare at test time: robust learning by feature deletion. In Proceedings of the 23rd international conference on Machine learning, ICML '06, pages 353-360. ACM, 2006.
12. M. Grant and S. Boyd. CVX: Matlab software for disciplined convex programming, version 1.21. http://cvxr.com/cvx/, Apr. 2011.
13. M. Hall, E. Frank, G. Holmes, B. Pfahringer, P. Reutemann, and I. H. Witten. The weka data mining software: an update. SIGKDD Explor. Newsl., 11:10-18, November 2009.
14. M. Kantarcioglu, B. Xi, and C. Clifton. Classifier evaluation and attribute selection against active adversaries. Data Min. Knowl. Discov., 22:291-335, January 2011.
15. M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM Journal on Computing, 22:807-837, 1993.
16. G. R. G. Lanckriet, L. E. Ghaoui, C. Bhattacharyya, and J. M. I. A robust minimax approach to classification. Journal of Machine Learning Research, 3:555-582, 2002.
17. Z. Li, M. Sanghi, Y. Chen, M.-Y. Kao, and B. Chavez. Hamsa: Fast signature generation for zero-day polymorphic worms with provable attack resilience. In Proceedings of the 2006 IEEE Symposium on Security and Privacy. IEEE Computer Society, 2006.
18. W. Liu and S. Chawla. Mining adversarial patterns via regularized loss minimization. Mach. Learn., 81:69-83, October 2010.
19. D. Lowd. Good word attacks on statistical spam filters. In In Proceedings of the Second Conference on Email and Anti-Spam (CEAS), 2005.
20. D. Lowd and C. Meek. Adversarial learning. In Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, KDD '05, pages 641-647, 2005.
21. J. Newsome, B. Karp, and D. X. Song. Polygraph: Automatically generating signatures for polymorphic worms. In 2005 IEEE Symposium on Security and Privacy, 8-11 May 2005, Oakland, CA, USA, pages 226-241. IEEE Computer Society, 2005.
22. R. Perdisci, D. Dagon, W. Lee, P. Fogla, and M. Sharif. Misleadingworm signature generators using deliberate noise injection. In Proceedings of the 2006 IEEE Symposium on Security and Privacy, pages 17-31, 2006.
23. C. H. Teo, A. Globerson, S. T. Roweis, and A. J. Smola. Convex learning with invariances. In Advances in Neural Information Processing Systems, 2007.
24. K. Wang, J. J. Parekh, and S. J. Stolfo. Anagram: A content anomaly detector resistant to mimicry attack. In Recent Advances in Intrusion Detection, 9th International Symposium, pages 226-248, 2006.
25. G. L. Wittel and S. F. Wu. On attacking statistical spam filters. In Proceedings of the first Conference on Email and Anti-Spam (CEAS), 2004.