Boosting classifiers with tightened L0-relaxation penalties

ICML 2010 - Proceedings, 27th International Conference on Machine Learning

Volumn , Issue , 2010, Pages 383-390

  Goldberg, Noam ^a   Eckstein, Jonathan ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOSTING ALGORITHM; CLASSIFICATION ACCURACY; CLASSIFICATION PERFORMANCE; COMPUTATIONAL LEARNING THEORY; CONTINUOUS RELAXATION; CUTTING PLANES; DYNAMIC GENERATION; EMPIRICAL ERRORS; HALF-SPACE PROBLEM; HYPER-PLANE; INTEGER LINEAR PROGRAMS; INTEGER SOLUTIONS; LINEAR PROGRAMMING FORMULATION; MINIMUM DESCRIPTION LENGTH; MIXED INTEGER; ON CURRENTS; OPTIMIZATION FORMULATIONS; ROBUST CLASSIFICATION; SOFT MARGINS; SPARSE CLASSIFIERS; WEIGHT VECTOR; WEIGHTED VOTING;

ALGORITHMS; CLASSIFIERS; COMPUTATION THEORY; DYNAMIC PROGRAMMING; LEARNING SYSTEMS; LINEAR PROGRAMMING; OPTIMIZATION; PROGRAM INTERPRETERS;

INTEGER PROGRAMMING;

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

References (23)

1. Asuncion, A. and Newman, D.J. UCI machine learning repository, 2007. URL http://www.ics.uci.edu/~mlearn/MLRepository.html.
2. Bennett, K.P. and Bredensteiner, E.J. Duality and geometry in SVM classifers. Proc. of the 17th Int. Conf. on Machine Learning, pp. 57-64, 2000.
3. Blum, A. and Langford, J. PAC-MDL bounds. In Proc. of the 16th Annual Conf. on Computational Learning Theory, pp. 344-357, 2003.
4. Boros, E., Hammer, P.L., Ibaraki, T. and Kogan, A. Logical analysis of numerical data. Math. Programming, 79:163-190, 1997.
5. Cohen, W.W. and Singer, Y. A simple, fast, and effective rule learner. In Proc. of the 16th National Conf. on Artificial Intelligence, pp. 335-342, 1999.
6. Cortes, C. and Vapnik, V. Support-vector networks. Machine Learning, 20:273-297, 1995.
7. Demiriz, A., Bennett, K.P. and Shawe-Taylor, J. Linear programming boosting via column generation. Machine Learning, 46:225-254, 2002.
8. Eckstein, J. and Goldberg, N. An improved branch- and-bound method for maximum monomial agreement. In Optimization for Machine Learning, NIPS Workshop, 2008. URL http://opt2008.kyb.tuebingen.mpg.de/eckst?in.pdf.
9. Freund, Y. and Schapire, R.E. A decision-theoretic generalization of on-line learning and an application to boosting. J. of Computer and Systems Sciences, 55(1):119-139, 1997.
10. Friedman, J.H. and Popescu, B.E. Predictive learning via rule ensembles. Annals of Applied Statistics, 2 (3):916-954, 2008.
11. Goldberg, N. Optimization for Sparse and Accurate Classifiers. PhD thesis, Rutgers University, 2010.
12. Goldberg, N. and Eckstein, J. Sparse weighted voting classifier selection and its LP relaxation. Technical Report RRR 9-2010, RUTCOR, Rutgers University, 2010.
13. Goldberg, N. and Shan, C. Boosting optimal logical patterns. In Proc. of SIAM Int. Conf. on Data Mining, 2007.
14. Graepel, T., Herbrich, R., Schölkopf, B., Smola, A., Bartlett, P., Müller, K-R., Obermayer, K. and Williamson, R. Classification on proximity data with LP-machines. Int. Conf. of Artificial Neural Networks, pp. 304-309, 1999.
15. Grünwald, Peter D. The minimum description length principle. MIT Press, 2007.
16. Höffgen, K-U., Simon, H.U. and Horn, K.S. Van. Robust trainability of single neurons. J. of Computer and Systems Sciences, 50:114-125, 1995.
17. Kearns, M.J., Schapire, R.E. and Sellie, L.M. Toward efficient agnostic learning. Machine Learning, 17(2- 3):115-141, 1994.
18. Lübbecke, M.E. and Desrosiers, J. Selected topics in column generation. Operations Research, 53(6): 1007-1023, 2005.
19. Rätsch, G., Onoda, T. and Müller, K-R. Soft margins for AdaBoost. Machine Learning, 42:287-320, 2001.
20. Shawe-Taylor, J., Bartlett, P.L., Williamson, R.C. and Anthony, M. Structural risk minimization over data-dependent hierarchies. IEEE Trans, on Information Theory, 44:1926-1940, 1998.
21. Vapnik, V.N. Statistical learning theory. John Wiley and Sons, 1998.
22. Von Luxburg, U., Bousquet, O. and Schölkopf, B. A compression approach to support vector model selection. J. of Machine Learning Research, 5:293- 323, 2004.
23. Weston, J., Elisseeff, A., Schölkopf, B. and Tipping, M. Use of the zero norm with linear models and kernel methods. J. of Machine Learning Research, 3:1439-1461, 2003.