Learning sparse classifiers with difference of convex functions algorithms

References

• Ben-Hur , A. , Ong , C. S. , Sonnenburg , S. , Schölkopf , B. and Rätsch , G. 2008 . Support vector machines and kernels for computational biology . PLoS Comput. Biol , 4 ( 10 ) e1000173, (doi:10.1371/journal.pcbi.1000173)
   PubMed Web of Science ®Google Scholar
• Bradley , P. S. and Mangasarian , O. L. Feature selection via concave minimization and support vector machines . Proceedings of International Conference on Machina Learning . Madison , , Wisconsin, USA
   Google Scholar
• Collobert , R. , Sinz , F. , Weston , J. and Bottou , L. 2007 . “ Trading convexity for scalability ” . In Large Scale Kernel Machines , Edited by: Bottou , L. , Chapelle , O. , DeCoste , D. and Weston , J. 275 – 300 . USA : MIT Press .
   Google Scholar
• Do , C. B. , Le , Q. , Teo , C. H. , Chapelle , O. and Smola , A. Tighter bounds for structured estimation . in Proceedings of Neural Information Processing Systems . pp. 281 – 288 . British Columbia , , Canada : Vancouver .
   Google Scholar
• Fan , R.-E. , Chang , K.-W. , Hsieh , C.-J. , Wang , X.-R. and Lin , C.-J. 2008 . LIBLINEAR: A library for large linear classification . J. Mach. Learn. Res , 9 : 1871 – 1874 .
   Web of Science ®Google Scholar
• Freund , Y. 2009 . A more robust boosting algorithm . Tech. Rep , arXiv:0905.2138.v1, Computer Science and Engineering, UCSD
   Google Scholar
• Gasso , G. , Rakotomamonjy , A. and Canu , S. 2009 . Recovering sparse signals with a certain family of non-convex penalties and DC programming . IEEE Trans. Signal Process , 57 ( 12 ) : 4686 – 4698 . (doi:10.1109/TSP.2009.2026004)
   Web of Science ®Google Scholar
• Guyon , I. and Elisseeff , A. 2003 . An introduction to variable and feature selection . J. Mach. Learn. Res , 3 : 1157 – 1182 .
   Google Scholar
• Hiriart-Urruty , J.-B. and Lemaréchal , C. 2001 . Fundamentals of Convex Analysis , Verlag : Springer .
   Google Scholar
• Krause , N. and Singer , Y. Leveraging the margin more carefully . Proceedings of the Twenty-first International Conference on Machine Learning . Banff, Alberta , , Canada
   Google Scholar
• Le Thi , H. A. and Pham Dinh , T. 2005 . The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems . Ann. Oper. Res , 133 : 23 – 46 . (doi:10.1007/s10479-004-5022-1)
   Web of Science ®Google Scholar
• Le Thi , H. A. , Belghiti , T. and Pham Dinh , T. 2006 . A new efficient algorithm based on DC programming and DCA for clustering . J. Global Optim , 37 : 593 – 608 .
   Web of Science ®Google Scholar
• Le Thi , H. A. , Minh Le , H. and Pham Dinh , T. 2007 . Optimization based DC programming and DCA for hierarchical clustering . Eur. J. Oper. Res , 183 : 1067 – 1085 . (doi:10.1016/j.ejor.2005.07.028)
   Web of Science ®Google Scholar
• Le Thi , H. A. , Le , H. M. , Nguyen , V. V. and Pham Dinh , T. 2008 . A DC programming approach for feature selection in support vector machines learning . Adv. Data Anal. Classification , 2 ( 3 ) : 259 – 278 . (doi:10.1007/s11634-008-0030-7)
   Web of Science ®Google Scholar
• Liu , Y. and Shen , X. 2006 . Multicategory ψ-learning . J. Amer. Statist. Assoc , 101 : 500 – 509 . (doi:10.1198/016214505000000781)
   Web of Science ®Google Scholar
• Liu , Y. , Shen , X. and Doss , H. 2005 . Multicategory ψ-learning and support vector machine: Computational tools . J. Comput. Graph. Statist , 14 : 219 – 236 . (doi:10.1198/106186005X37238)
   Web of Science ®Google Scholar
• Long , P. and Servedio , R. Random classification noise defeats all convex potential boosters . International Conference on Machine Learning . Helsinki , , Finland
   Google Scholar
• Mangasarian , O. L. 2006 . Exact 1-norm support vector machines via unconstrained convex differentiable minimization . J. Mach. Learn. Res , 7 : 1517 – 1530 .
   Web of Science ®Google Scholar
• Meinshausen , N. and Yu , B. 2009 . Lasso-type recovery of sparse representations for high-dimensional data . Ann. Statist , 37 ( 1 ) : 246 – 270 . (doi:10.1214/07-AOS582)
   Web of Science ®Google Scholar
• Neumann , J. , Schnörr , C. and Steidl , G. 2005 . Combined SVM-based feature selection and classification . Mach. Learn , 61 ( 1–3 ) : 129 – 150 . (doi:10.1007/s10994-005-1505-9)
   Web of Science ®Google Scholar
• Peleg , D. and Meir , R. 2008 . A bilinear formulation for vector sparsity optimization . Signal Process , 88 : 375 – 389 . (doi:10.1016/j.sigpro.2007.08.015)
   Web of Science ®Google Scholar
• Pham Dinh , T. 1986 . “ Algorithms for solving a class of non convex optimization problems. Methods of subgradients ” . In Fermat Days 85. Mathematics for Optimization , Edited by: Hiriart-Urruty , J. B. B.V. North-Holland : Elsevier Science Publishers .
   Google Scholar
• Pham Dinh , T. and Le Thi , H. A. 1998 . DC optimization algorithms for solving the trust region subproblem . SIAM J. Optim , 8 ( 2 ) : 476 – 505 . (doi:10.1137/S1052623494274313)
   Web of Science ®Google Scholar
• Schölkopf , B. and Smola , A. J. 2002 . Learning with Kernels , USA : MIT Press .
   Google Scholar
• Steinwart , I. 2001 . On the influence of the kernel on the consistency of support vector machines . J. Mach. Learn. Res , 2 : 67 – 93 .
   Web of Science ®Google Scholar
• Steinwart , I. and Christmann , A. 2008 . “ Support Vector Machines ” . In Information Science and Statistics , Springer Verlag .
   Google Scholar
• Steinwart , I. , Hush , D. and Scovel , C. “ An oracle inequality for clipped regularized risk minimizers ” . In Advances in Neural Information Processing Systems 19 , Edited by: Schölkopf , B. , Platt , J. and Hoffman , T. 1321 – 1328 . Cambridge , MA : MIT Press .
   Google Scholar
• Tibshirani , R. 1996 . Regression shrinkage and selection via the LASSO . J. R. Statist. Soc. B , 58 ( 1 ) : 267 – 288 .
   Google Scholar
• Wu , Y. and Liu , Y. 2007 . Robust truncated-hinge-loss support vector machines . J. Amer. Statist. Assoc , 102 ( 479 ) : 974 – 983 . (doi:10.1198/016214507000000617)
   Web of Science ®Google Scholar
• Yuille , A. L. and Rangarajan , A. 2003 . The concave-convex procedure . Neural Comput , 15 ( 4 ) : 915 – 936 . (doi:10.1162/08997660360581958)
   PubMed Web of Science ®Google Scholar
• Zhang , T. 2009 . Some sharp performance bounds for least squares regression with l1 regularization . Ann. Statist , 37 ( 5A ) : 109 – 2144 .
   Google Scholar
• Zhu , J. and Xing , E. P. On primal and dual sparsity of Markov networks . International Conference on Machine Learning . Quebec , , Canada : Montreal .
   Google Scholar
• Zhu , J. , Rosset , S. , Hastie , T. and Tibshirani , R. 2004 . “ 1-Norm support vector machines ” . In Neural Information Processing Systems
   Google Scholar