Classification with support hyperplanes

Authors:
Georgi I. Nalbantov;Jan C. Bioch;Patrick J. F. Groenen
Affiliations:
ERIM, Erasmus University Rotterdam;Econometric Institute, Erasmus University Rotterdam;Econometric Institute, Erasmus University Rotterdam
Venue:
ECML'06 Proceedings of the 17th European conference on Machine Learning
Year:
2006

Citing 9
Cited 0

The nature of statistical learning theory

The nature of statistical learning theory
Bagging predictors

Machine Learning
An introduction to support Vector Machines: and other kernel-based learning methods

An introduction to support Vector Machines: and other kernel-based learning methods
A Comparison of Prediction Accuracy, Complexity, and Training Time of Thirty-Three Old and New Classification Algorithms

Machine Learning
A Tutorial on Support Vector Machines for Pattern Recognition

Data Mining and Knowledge Discovery
Tree induction vs. logistic regression: a learning-curve analysis

The Journal of Machine Learning Research
Benchmarking Least Squares Support Vector Machine Classifiers

Machine Learning
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
LIBSVM: A library for support vector machines

ACM Transactions on Intelligent Systems and Technology (TIST)

Quantified Score

Hi-index	0.01

Visualization

Abstract

A new classification method is proposed, called Support Hyperplanes (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 variables. The performance of SHs against standard classifiers is promising on several widely-used empirical data sets.