Relaxing support vectors for classification

DOI10.1007/s10479-012-1193-3zbMath1302.68238OpenAlexW2044670456MaRDI QIDQ744716

J. Paul Brooks, Onur Şeref, Wanpracha Art Chaovalitwongse

Publication date: 26 September 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1193-3

zbMATH Keywords

classificationerror boundssupport vector machinesmultiple instance classification

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Related Items (3)

Multiple instance classification via quadratic programming ⋮ Weighted relaxed support vector machines ⋮ Relaxed support vector regression

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incorporating multiple SVMs for automatic image annotation
• Multiple instance classification via successive linear programming
• Elastic-net regularization in learning theory
• Solving the multiple instance problem with axis-parallel rectangles.
• Support vector machines are universally consistent
• Support-vector networks
• Support vector machines with different norms: motivation, formulations and results
• 10.1162/153244302760185252
• Consistency of Support Vector Machines and Other Regularized Kernel Classifiers
• Robust Truncated Hinge Loss Support Vector Machines
• 10.1162/153244303321897690
• Regularization and Variable Selection Via the Elastic Net
• Estimation by the nearest neighbor rule
• Low Moments for Small Samples: A Comparative Study of Order Statistics

This page was built for publication: Relaxing support vectors for classification