Clipping algorithms for solving the nearest point problem over reduced convex hulls
type: Item
instance of: scholarly article
title: Clipping algorithms for solving the nearest point problem over reduced convex hulls
zbMATH Open document ID: 1209.68417
author: Sumit K. Garg
published in: Pattern Recognition
publication date: 2011-01-31T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5843009
zbMATH Keywords: support vector machines
zbMATH Keywords: nearest point problem
zbMATH Keywords: reduced convex hulls
zbMATH Keywords: GSK algorithm
zbMATH Keywords: MDM algorithm
MaRDI profile type: Publication
full work available at URL: j.patcog.2010.08.030
OpenAlex ID: W1980351761
cites work: An iterative algorithm learning the maximal margin classifier.
cites work: Finding the Point of a Polyhedron Closest to the Origin
cites work: A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
cites work: Dual unification of bi-class support vector machine formulations
cites work: Unified dual for bi-class SVM approaches
DOI: 10.1016/J.PATCOG.2010.08.030
description: scientific article; zbMATH DE number 5843009