{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T06:28:58Z","timestamp":1720592938224},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T00:00:00Z","timestamp":1279756800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10994-010-5199-2","type":"journal-article","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T19:18:00Z","timestamp":1279739880000},"page":"69-83","source":"Crossref","is-referenced-by-count":37,"title":["Mining adversarial patterns via regularized loss minimization"],"prefix":"10.1007","volume":"81","author":[{"given":"Wei","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjay","family":"Chawla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,7,22]]},"reference":[{"issue":"1","key":"5199_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/S1064827595289108","volume":"21","author":"M. Branch","year":"2000","unstructured":"Branch, M., Coleman, T., & Li, Y. (2000). A subspace, interior, and conjugate gradient method for large-scale bound-constrained minimization problems. SIAM Journal on Scientific Computing, 21(1), 1\u201323.","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"5199_CR2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF01580735","volume":"40","author":"R. Byrd","year":"1988","unstructured":"Byrd, R., Schnabel, R., & Shultz, G. (1988). Approximate solution of the trust region problem by minimization over two-dimensional subspaces. Mathematical Programming, 40(1), 247\u2013263.","journal-title":"Mathematical Programming"},{"issue":"1","key":"5199_CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"48","author":"M. Collins","year":"2002","unstructured":"Collins, M., Schapire, R., & Singer, Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48(1), 253\u2013285.","journal-title":"Machine Learning"},{"key":"5199_CR4","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/1014052.1014066","volume-title":"KDD\u201904: proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"N. Dalvi","year":"2004","unstructured":"Dalvi, N., Domingos, P. Mausam, Sanghai, S., & Verma, D. (2004). Adversarial classification. In KDD\u201904: proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 99\u2013108). New York: ACM."},{"issue":"4\u20135","key":"5199_CR5","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.knosys.2004.10.002","volume":"18","author":"S. J. Delany","year":"2005","unstructured":"Delany, S. J., Cunningham, P., Tsymbal, A., & Coyle, L. (2005). A case-based technique for tracking concept drift in spam filtering. Knowledge-Based Systems, 18(4\u20135), 187\u2013195.","journal-title":"Knowledge-Based Systems"},{"key":"5199_CR6","first-page":"30","volume":"7","author":"J. Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar, J. (2006). Statistical comparisons of classifiers over multiple data sets. The Journal of Machine Learning Research, 7, 30.","journal-title":"The Journal of Machine Learning Research"},{"key":"5199_CR7","volume-title":"Games of strategy","author":"A. Dixit","year":"1999","unstructured":"Dixit, A., & Skeath, S. (1999). Games of strategy. New York: Norton."},{"key":"5199_CR8","volume-title":"Game theory","author":"D. Fudenberg","year":"1991","unstructured":"Fudenberg, D., & Tirole, J. (1991). Game theory (1st ed.). Cambridge: MIT Press.","edition":"1"},{"key":"5199_CR9","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1145\/1143844.1143889","volume-title":"Proceedings of the 23rd international conference on machine learning","author":"A. Globerson","year":"2006","unstructured":"Globerson, A., & Roweis, S. (2006). Nightmare at test time: robust learning by feature deletion. In Proceedings of the 23rd international conference on machine learning (pp. 353\u2013360). New York: ACM."},{"key":"5199_CR10","volume-title":"Dataset shift in machine learning","author":"A. Globerson","year":"2008","unstructured":"Globerson, A., Teo, C. H., Smola, A., & Roweis, S. (2008). An adversarial view of covariate shift and a minimax approach. In Dataset shift in machine learning. Cambridge: MIT Press."},{"key":"5199_CR11","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R., & Friedman, J. (2001). The elements of statistical learning.","DOI":"10.1007\/978-0-387-21606-5"},{"key":"5199_CR12","unstructured":"Kantarcioglu, M., Xi, B., & Clifton, C. (2009). Classifier evaluation and attribute selection against active adversaries (Technical report). Department of Statistics, Purdue University."},{"issue":"1","key":"5199_CR13","first-page":"341","volume":"6","author":"S. Keerthi","year":"2006","unstructured":"Keerthi, S., & DeCoste, D. (2006). A modified finite Newton method for fast solution of large scale linear SVMs. Journal of Machine Learning Research, 6(1), 341.","journal-title":"Journal of Machine Learning Research"},{"key":"5199_CR14","unstructured":"Ko\u0142cz, A., & Teo, C. (2009). Feature weighting for improved classifier robustness. In CEAS\u201909: sixth conference on email and anti-spam."},{"key":"5199_CR15","first-page":"627","volume":"9","author":"C. Lin","year":"2008","unstructured":"Lin, C., Weng, R., & Keerthi, S. (2008). Trust region Newton method for logistic regression. The Journal of Machine Learning Research, 9, 627\u2013650.","journal-title":"The Journal of Machine Learning Research"},{"key":"5199_CR16","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/ICDMW.2009.9","volume-title":"Proceedings of the 2009 IEEE international conference on data mining workshops","author":"W. Liu","year":"2009","unstructured":"Liu, W., & Chawla, S. (2009). A game theoretical model for adversarial learning. In Proceedings of the 2009 IEEE international conference on data mining workshops (pp. 25\u201330). Los Alamitos: IEEE Comput. Soc."},{"key":"5199_CR17","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1145\/1081870.1081950","volume-title":"KDD\u201905: proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining","author":"D. Lowd","year":"2005","unstructured":"Lowd, D., & Meek, C. (2005). Adversarial learning. In KDD\u201905: proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining (pp. 641\u2013647). New York: ACM."},{"key":"5199_CR18","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J. Mor\u00e9","year":"1983","unstructured":"Mor\u00e9, J., & Sorensen, D. (1983). Computing a trust region step. SIAM Journal on Scientific and Statistical Computing, 4, 553.","journal-title":"SIAM Journal on Scientific and Statistical Computing"},{"issue":"3","key":"5199_CR19","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1137\/0720042","volume":"20","author":"T. Steihaug","year":"1983","unstructured":"Steihaug, T. (1983). The conjugate gradient method and trust regions in large scale optimization. SIAM Journal on Numerical Analysis, 20(3), 626\u2013637.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"1","key":"5199_CR20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1145\/507338.507355","volume":"31","author":"I. Witten","year":"2002","unstructured":"Witten, I., & Frank, E. (2002). Data mining: practical machine learning tools and techniques with Java implementations. ACM SIGMOD Record, 31(1), 76\u201377.","journal-title":"ACM SIGMOD Record"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5199-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5199-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5199-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T06:57:47Z","timestamp":1685689067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5199-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,7,22]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["5199"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5199-2","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,7,22]]}}}