{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,11]],"date-time":"2026-10-11T23:59:10Z","timestamp":1791763150357,"version":"4.3.4"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[2005,7,11]],"date-time":"2005-07-11T00:00:00Z","timestamp":1121040000000},"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":[[2005,11]]},"DOI":"10.1007\/s10994-005-1505-9","type":"journal-article","created":{"date-parts":[[2005,7,27]],"date-time":"2005-07-27T17:03:46Z","timestamp":1122483826000},"page":"129-150","source":"Crossref","is-referenced-by-count":216,"title":["Combined SVM-Based Feature Selection and Classification"],"prefix":"10.1007","volume":"61","author":[{"given":"Julia","family":"Neumann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Schn\u00f6rr","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gabriele","family":"Steidl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,7,11]]},"reference":[{"key":"1505_CR1","doi-asserted-by":"crossref","unstructured":"Bach, F., Lanckriet, G., & Jordan, M. (2004). Multiple kernel learning, conic duality, and the SMO algorithm. In Proceedings of the 21st International Conference on Machine Learning. New York, NY: ACM Press.","DOI":"10.1145\/1015330.1015424"},{"issue":"2","key":"1505_CR2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1137\/S1052623493259215","volume":"7","author":"A. Ben-Tal","year":"1997","unstructured":"Ben-Tal, A., & Zibulevsky, M. (1997). Penalty\/Barrier multiplier methods for convex programming problems. SIAM Journal on Optimization, 7:2, 347\u2013366.","journal-title":"SIAM Journal on Optimization"},{"key":"1505_CR3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/10556789208805504","volume":"1","author":"K. P. Bennett","year":"1992","unstructured":"Bennett, K. P., & Mangasarian, O. L. (1992). Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1, 23\u201334.","journal-title":"Optimization Methods and Software"},{"key":"1505_CR4","unstructured":"Blake, C. L., & Merz, C. J. (1998). UCI repository of machine learning databases."},{"key":"1505_CR5","unstructured":"Bradley, P. S. (1998). Mathematical programming approaches to machine learning and data mining. Ph.D. thesis, University of Wisconsin, Computer Sciences Dept., Madison, WI, TR-98-11."},{"key":"1505_CR6","first-page":"82","volume-title":"Proceedings of the 15th international conference on machine learning","author":"P. S. Bradley","year":"1998","unstructured":"Bradley, P. S., & Mangasarian, O. L. (1998). Feature selection via concave minimization and support vector machines. In J. Shavlik (Ed.), Proceedings of the 15th international conference on machine learning (pp. 82\u201390). San Francisco, CA: Morgan Kaufmann."},{"issue":"5","key":"1505_CR7","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1109\/72.788646","volume":"10","author":"O. Chapelle","year":"1999","unstructured":"Chapelle, O., Haffner, P., & Vapnik, V. N. (1999). SVMs for histogram-based image classification. IEEE Transactions on Neural Networks, 10:5, 1055\u20131064.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"1505_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.7551\/mitpress\/1120.003.0052","volume-title":"Advances in neural information processing systems 14","author":"N. Cristianini","year":"2002","unstructured":"Cristianini, N., Shawe-Taylor, J., Elisseeff, A., & Kandola, J. (2002). On kernel-target alignment. In T. G. Dietterich, S. Becker, & Z. Ghahramani (Eds.), Advances in neural information processing systems 14 (pp. 367\u2013373). Cambridge, MA: MIT Press."},{"key":"1505_CR9","volume-title":"Pattern classification","author":"R. Duda","year":"2000","unstructured":"Duda, R., Hart, P., & Stork, D. (2000). Pattern classification. New York, NY: John Wiley & Sons, second edition."},{"key":"1505_CR10","first-page":"1157","volume":"3","author":"I. Guyon","year":"2003","unstructured":"Guyon, I., & Elisseeff, A. (2003). An introduction to variable and feature selection. Journal of Machine Learning Research, 3, 1157\u20131182.","journal-title":"Journal of Machine Learning Research"},{"key":"1505_CR11","first-page":"220","volume-title":"Pattern recognition, proc. of 26th DAGM symposium, Vol. 3175 of LNCS","author":"B. Haasdonk","year":"2004","unstructured":"Haasdonk, B., & Bahlmann, C. (2004). Learning with distance substitution kernels. In C. E. Rasmussen, H. H. B\u00fclthoff, M. A. Giese, & B. Sch\u00f6lkopf (Eds.), Pattern recognition, proc. of 26th DAGM symposium, Vol. 3175 of LNCS. (pp. 220\u2013227). Berlin: Springer."},{"key":"1505_CR12","unstructured":"Heiler, M., Cremers, D., & Schn\u00f6rr, C. (2001). Efficient feature subset selection for support vector machines. Technical Report TR-01-021, Comp. science series, Dept. of Mathematics and Computer Science, University of Mannheim."},{"key":"1505_CR13","doi-asserted-by":"crossref","unstructured":"Hermes, L., & Buhmann, J. M. (2000). Feature selection for support vector machines. In Proc. of the International Conference on Pattern Recognition (ICPR'00), Vol. 2 (pp. 716\u2013719).","DOI":"10.1109\/ICPR.2000.906174"},{"key":"1505_CR14","unstructured":"Ilog, Inc.: 2001, \u2018ILOG CPLEX 7.5\u2019."},{"key":"1505_CR15","unstructured":"Jakubik, O. J. (2003). Feature selection with concave minimization. Master's thesis, Dept. of Mathematics and Computer Science, University of Mannheim."},{"key":"1505_CR16","first-page":"291","volume-title":"Proceedings of the 16th international conference on machine learning","author":"T. Jebara","year":"2000","unstructured":"Jebara, T., & Jaakkola, T. (2000). Feature selection and dualities in maximum entropy discrimination. In I. Bratko & S. Dzeroski (Eds.), Proceedings of the 16th international conference on machine learning (pp. 291\u2013300). San Francisco, CA: Morgan Kaufmann."},{"key":"1505_CR17","first-page":"121","volume-title":"Proc. of the 11th international conference on machine learning","author":"G. H. John","year":"1994","unstructured":"John, G. H., Kohavi, R., & Pfleger, K. (1994). Irrelevant features and the subset selection problem. In R. S. Michalski & G. Tecuci (Eds.), Proc. of the 11th international conference on machine learning (pp. 121\u2013129). San Francisco, CA: Morgan Kaufmann."},{"key":"1505_CR18","unstructured":"Mangasarian, O. L. (1997). Minimum-support solutions of polyhedral concave programs. Technical Report TR-1997-05, Mathematical Programming, University of Wisconsin."},{"key":"1505_CR19","unstructured":"MathWorks. (2002). Optimization toolbox user's Guide. The MathWorks, Inc."},{"key":"1505_CR20","first-page":"212","volume-title":"Pattern recognition, proc. of 26th DAGM symposium, Vol. 3175 of LNCS","author":"J. Neumann","year":"2004","unstructured":"Neumann, J., Schn\u00f6rr, C., & Steidl, G. (2004). SVM-based feature selection by direct objective minimisation. In C. E. Rasmussen, H. H. B\u00fclthoff, M. A. Giese, & B. Sch\u00f6lkopf (Eds.), Pattern recognition, proc. of 26th DAGM symposium, Vol. 3175 of LNCS (pp. 212\u2013219). Berlin: Springer."},{"key":"1505_CR21","unstructured":"Pham Dinh, T., & Elbernoussi, S. (1988). Duality in d.c. (difference of convex functions optimization. Subgradient Methods. In Trends in Mathematical Optimization, Vol. 84 of Int. Series of Numer. Math. Basel: Birk\u00e4user Verlag (pp. 277\u2013293)."},{"issue":"2","key":"1505_CR22","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T. Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., & Hoai An, L. T. (1998). A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem. SIAM Journal on Optimization, 8:2, 476\u2013505.","journal-title":"SIAM Journal on Optimization"},{"key":"1505_CR23","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R. T. Rockafellar","year":"1970","unstructured":"Rockafellar, R. T. (1970). Convex analysis. Princeton, NJ: Princeton University Press."},{"key":"1505_CR24","unstructured":"Schmidt, S. (2004). Context-sensitive image labeling based on logistic regression. Master's thesis, Dept. of Mathematics and Computer Science, University of Mannheim."},{"key":"1505_CR25","volume-title":"Learning with kernels","author":"B. Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., & Smola, A. J. (2002). Learning with kernels. Cambridge, MA: MIT Press."},{"issue":"1","key":"1505_CR26","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R. Tibshirani","year":"1996","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society, Series B, 58:1, 267\u2013288.","journal-title":"Journal of the Royal Statistical Society, Series B"},{"key":"1505_CR27","first-page":"1439","volume":"3","author":"J. Weston","year":"2003","unstructured":"Weston, J., Elisseeff, A., Sch\u00f6lkopf, B., & Tipping, M. (2003). Use of the zero-norm with linear models and kernel methods. Journal of Machine Learning Research, 3, 1439\u20131461.","journal-title":"Journal of Machine Learning Research"},{"key":"1505_CR28","first-page":"668","volume-title":"Advances in neural information processing systems 13","author":"J. Weston","year":"2001","unstructured":"Weston, J., Mukherjee, S., Chapelle, O., Pontil, M., Poggio, T., & Vapnik, V. (2001). Feature Selection for SVMs. In T. K. Leen, T. G. Dietterich, & V. Tresp (Eds.), Advances in neural information processing systems 13 (pp. 668\u2013674). Cambridge, MA: MIT Press."},{"key":"1505_CR29","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A. Yuille","year":"2003","unstructured":"Yuille, A., & Rangarajan, A. (2003). The convex-concave procedure. Neural Computation, 15, 915\u2013936.","journal-title":"Neural Computation"},{"key":"1505_CR30","volume-title":"Advances in neural information processing systems 16","author":"J. Zhu","year":"2004","unstructured":"Zhu, J., Rosset, S., Hastie, T., & Tibshirani, R. (2004). 1-norm support vector machines. In S. Thrun, L. Saul, & B. Sch\u00f6lkopf (Eds.), Advances in neural information processing systems 16. Cambridge, MA: MIT Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-005-1505-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-005-1505-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-005-1505-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T18:48:53Z","timestamp":1735843733000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-005-1505-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,11]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["1505"],"URL":"https:\/\/doi.org\/10.1007\/s10994-005-1505-9","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,7,11]]}}}