Support vector machine classifiers with uncertain knowledge sets via robust optimization

DOI10.1080/02331934.2012.703667zbMath1298.65104OpenAlexW2061261867WikidataQ59241495 ScholiaQ59241495MaRDI QIDQ5495576

Guoyin Li, Shan Suthaharan, Vaithilingam Jeyakumar

Publication date: 5 August 2014

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331934.2012.703667

zbMATH Keywords

convex optimizationnumerical examplesdualityquadratic optimizationrobust optimizationsupport vector machine classifiersrobust Farkas' lemmauncertain knowledge sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Quadratic programming (90C20) Knowledge representation (68T30) Machine vision and scene understanding (68T45)

Related Items (8)

Robust solutions to multi-objective linear programs with uncertain data ⋮ Robust optimization and data classification for characterization of Huntington disease onset via duality methods ⋮ Robust L1-norm two-dimensional linear discriminant analysis ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions ⋮ Robust L1-norm non-parallel proximal support vector machine ⋮ Robust recursive absolute value inequalities discriminant analysis with sparseness ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ Strong duality for robust minimax fractional programming problems

Cites Work

• Unnamed Item
• Knowledge based least squares twin support vector machines
• Robust conjugate duality for convex optimization under uncertainty with application to data classification
• Characterizing robust set containments and solutions of uncertain linear programs without qualifications
• Simultaneous classification and feature selection via convex quadratic programming with application to HIV-associated neurocognitive disorder assessment
• Robust optimization-methodology and applications
• A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
• Knowledge based proximal support vector machines
• Strong Duality in Robust Convex Programming: Complete Characterizations
• Knowledge-based semidefinite linear programming classifiers
• 10.1162/15324430152748218
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Knowledge-Based Linear Programming

This page was built for publication: Support vector machine classifiers with uncertain knowledge sets via robust optimization