ACM Home Page
Please provide us with feedback. Feedback
Proximal support vector machine classifiers
Full text PdfPdf (756 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Francisco, California
Pages: 77 - 86  
Year of Publication: 2001
ISBN:1-58113-391-X
Authors
Glenn Fung  University of Wisconsin, Madison, WI
Olvi L. Mangasarian  University of Wisconsin, Madison, WI
Sponsors
SIGMOD: ACM Special Interest Group on Management of Data
AAAI : American Association for Artificial Intelligence
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 27,   Downloads (12 Months): 175,   Citation Count: 48
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/502512.502527
What is a DOI?

ABSTRACT

Instead of a standard support vector machine (SVM) that classifies points by assigning them to one of two disjoint half-spaces, points are classified by assigning them to the closest of two parallel planes (in input or feature space) that are pushed apart as far as possible. This formulation, which can also be interpreted as regularized least squares and considered in the much more general context of regularized networks [8, 9], leads to an extremely fast and simple algorithm for generating a linear or nonlinear classifier that merely requires the solution of a single system of linear equations. In contrast, standard SVMs solve a quadratic or a linear program that require considerably longer computational time. Computational results on publicly available datasets indicate that the proposed proximal SVM classifier has comparable test set correctness to that of standard SVM classifiers, but with considerably faster computational time that can be an order of magnitude faster. The linear proximal SVM can easily handle large datasets as indicated by the classification of a 2 million point 10-attribute set in 20.8 seconds. All computational results are based on 6 lines of MATLAB code.


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
 
2
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23-34, 1992.
 
3
P. S. Bradley and O. L. Mangasarian. Massive data discrimination via linear support vector machines. Optimization Methods and Software, 13:1-10, 2000. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98- 03.ps.
 
4
US Census Bureau. Adult dataset. Publicly available from: www.sgi.com/Technology/mlc/db/.
 
5
 
6
 
7
CPLEX Optimization Inc., Incline Village, Nevada. Using the CPLEX(TM) Linear Optimizer and CPLEX(TM) Mixed Integer Optimizer (Version 2.0), 1992.
 
8
T. Evgeniou, M. Pontil, and T. Poggio. Regularization networks and support vector machines. Advances in Computational Mathematics, 13:1-50, 2000.
 
9
T. Evgeniou, M. Pontil, and T. Poggio. Regularization networks and support vector machines. In A. Smola, P. Bartlett, B. Sch51kopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 171-203, Cambridge, MA, 2000. MIT Press.
 
10
M. C. Ferris and T. S. Munson. Interior point methods for massive support vector machines. Technical Report 00-05, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, May 2000. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/00-05.ps.
11
 
12
G. Fung, O. L. Mangasarian, and A. Smola. Minimal kernel classifiers. Technical Report 00-08, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, November 2000. ftp: //ftp.cs, wisc.edu /pub/dmi/tech-reports/ O0-O8.ps.
 
13
D. Gale. The Theory of Linear Economic Models. McGraw-Hill Book Company, New York, 1960.
 
14
 
15
J. Gracke, M. Griebel, and M. Thess. Data mining with sparse grids. Technical report, Institut f/ir Angrwandte Mathematik, Universita~t Bonn, Bonn, Germany, 2000. http://wissrech.iam.unibonn.de/research/projects/garcke/sparsemining.html.
 
16
 
17
Y.-J. Lee and O. L. Mangasarian. RSVM: Reduced support vector machines. Technical Report 00-07, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, July 2000. Proceedings of the First SIAM International Conference on Data Mining, Chicago, April 5-7, 2001, CD-ROM. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/00-07.ps.
 
18
 
19
O. L. Mangasarian. Nonlinear Programming. SIAM, Philadelphia, PA, 1994.
 
20
O. L. Mangasarian. Generalized support vector machines. In A. Smola, P. Bartlett, B. SchSlkopf, and D. Schuurmans, editors, Advances in Large Margin Classifiers, pages 135:146, Cambridge, MA, 2000. MIT Press. ftp://ftp.cs.wisc.edu/math-prog/techreports/98-14.ps.
 
21
O. L. Mangasarian and R. R. Meyer. Nonlinear perturbation of linear programs. SIAM Journal on Control and Optimization, 17(6):745-752, November 1979.
 
22
O. L. Mangasarian and D. R. Musicant. Successive overrelaxation for support vector machines. IEEE Transactions on Neural Networks, 10:1032-1037, 1999. ftp://ftp.cs.wisc.edu/math-prog/tech-reports/98- 18.ps.
 
23
O. L. Mangasarian and D. R. Musicant. Active support vector machine classification. Technical Report 00-04, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, April 2000. Machine Learning, to appear. ftp://ftp.cs.wisc.edu/pub/dmi/tech-reports/OO-O4.ps.
 
24
 
25
 
26
MATLAB. User's Guide. The MathWorks, Inc., Natick, MA 01760, 1994-2001. http://www.mathworks.com.
 
27
 
28
P. M. Murphy and D. W. Aha. UCI repository of machine learning databases, 1992. www.ics.uci.edu/~mlearn/MLRepository.html.
 
29
D. R. Musicant. NDC: normally distributed clustered datasets, 1998. www.cs.wisc.edu/~-.musicant/data/ndc/.
 
30
S. Odewahn, E. Stockwell, R. Pennington, R. Humphreys, and W. Zumach. Automated star/galaxy discrimination with neural networks. Astronomical Journal, 103(1):318-331, 1992.
 
31
 
32
 
33
 
34
A. N. Tikhonov and V. Y. Arsenin. Solutions of Ill-Posed Problems. John Wiley ~: Sons, New York, 1977.
 
35
 
36
 
37
Alexis Wieland. Twin spiral dataset, http://wwwcgi.cs.cmu.edu/afs/cs.cmu.edu/project/airepository/ai/areas/neural/bench/cmu/0.html.

CITED BY  48

Collaborative Colleagues:
Glenn Fung: colleagues
Olvi L. Mangasarian: colleagues