## Proximal support vector machine classifiers (2001)

### Cached

### Download Links

- [www.ece.duke.edu]
- [people.ee.duke.edu]
- [ftp.cs.wisc.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings KDD-2001: Knowledge Discovery and Data Mining |

Citations: | 109 - 14 self |

### BibTeX

@INPROCEEDINGS{Mangasarian01proximalsupport,

author = {Olvi L. Mangasarian and Edward W. Wild},

title = {Proximal support vector machine classifiers},

booktitle = {Proceedings KDD-2001: Knowledge Discovery and Data Mining},

year = {2001},

pages = {77--86}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract—A new approach to support vector machine (SVM) classification is proposed wherein each of two data sets are proximal to one of two distinct planes that are not parallel to each other. Each plane is generated such that it is closest to one of the two data sets and as far as possible from the other data set. Each of the two nonparallel proximal planes is obtained by a single MATLAB command as the eigenvector corresponding to a smallest eigenvalue of a generalized eigenvalue problem. Classification by proximity to two distinct nonlinear surfaces generated by a nonlinear kernel also leads to two simple generalized eigenvalue problems. The effectiveness of the proposed method is demonstrated by tests on simple examples as well as on a number of public data sets. These examples show the advantages of the proposed approach in both computation time and test set correctness. Index Terms—Support vector machines, proximal classification, generalized eigenvalues. 1