Hyperdisk Based Large Margin Classifiers

Abstract : We introduce a large margin linear binary classification framework that approximates each class with a hyperdisk - the intersection of the affine support and the bounding hypersphere of its training samples in feature space - and then finds the linear classifier that maximizes the margin separating the two hyperdisks. We contrast this with Support Vector Machines (SVMs), which find the maximum-margin separator of the pointwise convex hulls of the training samples, arguing that replacing convex hulls with looser convex class models such as hyperdisks provides safer margin estimates that improve the accuracy on some problems. Both the hyperdisks and their separators are found by solving simple quadratic programs. The method is extended to nonlinear feature spaces using the kernel trick, and multi-class problems are dealt with by combining binary classifiers in the same ways as for SVMs. Experiments on a range of data sets show that the method compares favourably with other popular large margin classifiers.
Type de document :
Article dans une revue
Pattern Recognition, Elsevier, 2013, 46 (6), pp.1523-1531. 〈10.1016/j.patcog.2012.11.004〉
Liste complète des métadonnées

Contributeur : Brigitte Bidégaray-Fesquet <>
Soumis le : mardi 13 août 2013 - 00:13:22
Dernière modification le : lundi 9 avril 2018 - 12:22:48




Hakan Cevikalp, Bill Triggs. Hyperdisk Based Large Margin Classifiers. Pattern Recognition, Elsevier, 2013, 46 (6), pp.1523-1531. 〈10.1016/j.patcog.2012.11.004〉. 〈hal-00851192〉



Consultations de la notice