Sparse greedy minimax probability machine classification

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Strohmann, Thomas R ^a   Belitski, Andrei ^a   Grudic, Gregory Z ^a   DeCoste, Dennis ^b  

^a UCB 450   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COVARIANCE MATRIX;

CLASSIFICATION ALGORITHM; COMPUTATIONAL COSTS; COVARIANCE MATRICES; FEATURE WEIGHTING; KERNEL SELECTION; MAXIMUM PROBABILITY; MINIMAX PROBABILITY MACHINE CLASSIFICATIONS; STATE OF THE ART;

ALGORITHMS;

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

References (7)

1. A. W. Marshall and I. Olkin. Multivariate chebyshev inequalities. Annals of Mathematical Statistics, 31(4):1001-1014, 1960.
2. I. Popescu and D. Bertsimas. Optimal inequalities in probability theory: A convex optimization approach. Technical Report TM62, INSEAD, Dept. Math. O.R., Cambridge, Mass, 2001.
3. G. R. G. Lanckriet, L. E. Ghaoui, C. Bhattacharyya, and M. I. Jordan. Minimax probability machine. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 14, Cambridge, MA, 2002. MIT Press.
4. G. R. G. Lanckriet, L. E. Ghaoui, C. Bhattacharyya, and M. I. Jordan. A robust minimax approach to classification. Journal of Machine Learning Research, 3:555-582, 2002.
5. B. Scḧolkopf and A. Smola. Learning with Kernels. MIT Press, Cambridge, MA, 2002.
6. William H. Beyer. CRC Standard Mathemathical Tables, page 12. CRC Press Inc., Boca Raton, FL, 1987.
7. K. Crammer, J. Keshet, and Y. Singer. Kernel design using boosting. In T. G. Dietterich, S. Becker, and Z. Ghahramani, editors, Advances in Neural Information Processing Systems 15, Cambridge, MA, 2003. MIT Press.