ACM Home Page
Please provide us with feedback. Feedback
Learning large margin classifiers locally and globally
Full text PdfPdf (246 KB)
Source ACM International Conference Proceeding Series; Vol. 69 archive
Proceedings of the twenty-first international conference on Machine learning table of contents
Banff, Alberta, Canada
Page: 51  
Year of Publication: 2004
ISBN:1-58113-828-5
Authors
Kaizhu Huang  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Haiqin Yang  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Irwin King  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Michael R. Lyu  The Chinese University of Hong Kong, Shatin, N.T., Hong Kong
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 29,   Citation Count: 3
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1015330.1015365
What is a DOI?

ABSTRACT

A new large margin classifier, named Maxi-Min Margin Machine (M4) is proposed in this paper. This new classifier is constructed based on both a "local: and a "global" view of data, while the most popular large margin classifier, Support Vector Machine (SVM) and the recently-proposed important model, Minimax Probability Machine (MPM) consider data only either locally or globally. This new model is theoretically important in the sense that SVM and MPM can both be considered as its special case. Furthermore, the optimization of M4 can be cast as a sequential conic programming problem, which can be solved efficiently. We describe the M4 model definition, provide a clear geometrical interpretation, present theoretical justifications, propose efficient solving methods, and perform a series of evaluations on both synthetic data sets and real world benchmark data sets. Its comparison with SVM and MPM also demonstrates the advantages of our new model.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Bertsekas, D. P. (1999). Nonlinear programming. Belmont, Massashusetts: Athena Scientific. 2nd edition.
 
2
Breiman, L. (1998). Arcing classifiers. Annals of Statistics, 26(3), 801--849.
 
3
 
4
 
5
Lobo, M., Vandenberghe, L., Boyd, S., & Lebret, H. (1998). Applications of second order cone programming. Linear Algebra and its Applications, 284, 193--228.
 
6
Pruessner, A. (2003). Conic programming in GAMS. In Optimization software - the state of the art. http://www.gamsworld.org/cone/links.htm: INFORMS Atlanta.
 
7
 
8
Sturm, J. (1999). Using Sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optimization Methods and Software, 11, 625--653.
 
9

Collaborative Colleagues:
Kaizhu Huang: colleagues
Haiqin Yang: colleagues
Irwin King: colleagues
Michael R. Lyu: colleagues