A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty

DOI10.1016/j.patcog.2007.08.004zbMath1132.68665MaRDI QIDQ2462584

Jue Wang, Qing Tao, Gao-wei Wu

Publication date: 30 November 2007

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2007.08.004

zbMATH Keywords

classification; support vector machines; nearest points; \(\nu \)-SVMs; Gilbert's algorithms; Mitchell-Dem'yanov-Malozemov's algorithms; Schlesinger-Kozinec's algorithms; soft convex hulls

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68T10: Pattern recognition, speech recognition

Related Items

Clipping algorithms for solving the nearest point problem over reduced convex hulls, A \(\nu \)-twin support vector machine (\(\nu \)-TSVM) classifier and its geometric algorithms

Cites Work

• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• An iterative algorithm learning the maximal margin classifier.
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
• Ten lectures on statistical and structural pattern recognition.
• Kernel projection algorithm for large-scale SVM problems.
• Support-vector networks
• Training v-Support Vector Classifiers: Theory and Algorithms
• Finding the Point of a Polyhedron Closest to the Origin
• An Iterative Procedure for Computing the Minimum of a Quadratic Form on a Convex Set
• Unnamed Item
• Unnamed Item