Convex adversarial collective classification

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 642-650

  Torkamani, MohamadAli ^a   Lowd, Daniel ^a  

^a UNIVERSITY OF OREGON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION;

ACTIVE ADVERSARY; COLLECTIVE CLASSIFICATIONS; FIXED NUMBERS; MALICIOUS ADVERSARIES; OPTIMAL WEIGHT; POLYNOMIAL-TIME; QUADRATIC PROGRAMS;

LEARNING SYSTEMS;

EID: 84897511735     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. Abernethy, J., Chapelle, O., and Castillo, C. Graph regularization methods for web spam detection. Machine Learning, 81(2):207-225, 2010.
2. Adamic, L.A. and Glance, N. The political blogosphere and the 2004 us election: divided they blog. In Proceedings of the 3rd international workshop on Link discovery, pp. 36-43. ACM, 2005.
3. Brückner, M. and Scheffer, T. Nash equilibria of static prediction games. In Advances in Neural Information Processing Systems 22, 2009.
4. Brückner, M. and Scheffer, T. Stackelberg games for adversarial prediction problems. In Proceedings of the Seventeenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM Press, 2011.
5. Chau, D., Pandit, S., and Faloutsos, C. Detecting fraudulent personalities in networks of online auctioneers. Knowledge Discovery in Databases: PKDD 2006, pp. 103-114, 2006. (Pubitemid 44617716)
6. Dalvi, N., Domingos, P., M., Sanghai, S., and Verma, D. Adversarial classification. In Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 99-108, Seattle, WA, 2004. ACM Press.
7. Domingos, P. and Lowd, D. Markov Logic: An Interface Layer for AI. Morgan & Claypool, San Rafael, CA, 2009.
8. Drost, I. and Scheffer, T. Thwarting the nigritude ultramarine: Learning to identify link spam. In Proceedings of the Sixteenth European Conference on Machine Learning, pp. 96-107. Springer, 2005.
9. El Ghaoui, L., Lanckriet, G.R.G., and Natsoulis, G. Robust classification with interval data. Computer Science Division, University of California, 2003.
10. Globerson, A. and Roweis, S. Nightmare at test time: robust learning by feature deletion. In Proceedings of the Twenty-Third International Conference on Machine Learning, pp. 353-360, Pittsburgh, PA, 2006. ACM Press.
11. Huynh, T.N. and Mooney, R.J. Max-margin weight learning for Markov logic networks. In In Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML/PKDD-09). Bled, pp. 564-579. Springer, 2009.
12. Kim, S.J., Magnani, A., and Boyd, S. Robust fisher discriminant analysis. Advances in Neural Information Processing Systems, 18:659, 2006.
13. Kolmogorov, V. and Zabin, R. What energy functions can be minimized via graph cuts? Pattern Analysis and Machine Intelligence, IEEE Transactions on, 26 (2):147-159, 2004.
14. Lanckriet, G.R.G., Cristianini, N., Bartlett, P., Ghaoui, L.E., and Jordan, M.I. Learning the kernel matrix with semidefinite programming. The Journal of Machine Learning Research, 5:27-72, 2004.
15. Laskov, P. and Lippmann, R. Machine learning in adversarial environments. Machine learning, 81(2): 115-119, 2010.
16. Lowd, D. and Domingos, P. Efficient weight learning for Markov logic networks. In Proceedings of the Eleventh European Conference on Principles and Practice of Knowledge Discovery in Databases, pp. 200-211, Warsaw, Poland, 2007. Springer.
17. Lowd, D. and Meek, C. Good word attacks on statistical spam filters. In Proceedings of the Second Conference on Email and Anti-Spam (CEAS), pp. 125-132, 2005a.
18. Lowd, D. and Meek, C. Adversarial learning. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 641-647. ACM, 2005b. ISBN 159593135X.
19. Nelson, B., Rubinstein, B.I.P., Huang, L., Joseph, A.D., Lau, S., Lee, S.J., Rao, S., Tran, A., and Tygar, JD. Near-optimal evasion of convex-inducing classifiers. In Proceedings of the 13th International Conference on Artificial Intelligence and Statistics (AISTATS) 2010, volume 9, Chia Laguna Resort, Sardinia, Italy, 2010.
20. Peng, H., Long, F., and Ding, C. Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 27(8):1226-1238, 2005. (Pubitemid 41245053)
21. Sen, P., Namata, G., Bilgic, M., Getoor, L., Galligher, B., and Eliassi-Rad, T. Collective classification in network data. AI Magazine, 29(3):93, 2008. ISSN 0738-4602.
22. Taskar, B., Chatalbashev, V., and Roller, D. Learning associative Markov networks. In Proceedings of the twenty-first international conference on machine learning. ACM Press, 2004a.
23. Taskar, B., Wong, M. F., Abbeel, P., and Koller, D. Max-margin Markov networks. In Thrun, S., Saul, L., and Schölkopf, B. (eds.), Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA, 2004b.
24. Teo, C.H., Globerson, A., Roweis, S., and Smola, A. Convex learning with invariances. In Advances in Neural Information Processing Systems 21, 2008.