Classification with support hyperplanes
2006-07-19
Research Paper
| Related Files |
|---|
View PDF Version
(ei2006-42.pdf, 0.2MB) |
A new classification method is proposed, called Support Hy- perplanes (SHs). To solve the binary classification task, SHs consider the set of all hyperplanes that do not make classification mistakes, referred to as semi-consistent hyperplanes. A test object is classified using that semi-consistent hyperplane, which is farthest away from it. In this way, a good balance between goodness-of-fit and model complexity is achieved, where model complexity is proxied by the distance between a test object and a semi-consistent hyperplane. This idea of complexity resembles the one imputed in the width of the so-called margin between two classes, which arises in the context of Support Vector Machine learning. Class overlap can be handled via the introduction of kernels and/or slack vari- ables. The performance of SHs against standard classifiers is promising on several widely-used empirical data sets.
- hyperplane
- semi-consistent hyperplane
- semi-consistent
- support
- shs decision boundary
- classification
- point
- kernel
- decision
- method
- training data
- support hyperplanes
- support hyperplane
- data sets
- machine
- distance
- boundary
- test point x
- i =1 i
- class
