Smooth twin support vector machines via unconstrained convex minimization

DOI10.2298/FIL1708195TMaRDI QIDQ5156282zbMATH OpenOpenAlexFDO

Authors

Publication date 15 October 2021

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/fil1708195t

zbMATH Keywords

convex minimizationLagrangian support vector machinesmachine learningsmoothing techniquestwin support vector machine

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Quadratic programming (90C20) Convex programming (90C25)

Recommendations

• Smooth augmented Lagrangian method for twin bounded support vector machine
• Improved twin support vector machine
• A polynomial smooth twin support vector machines based on Newton-Armijo optimization
• Robust twin support vector machine for pattern classification
• A coordinate descent margin based-twin support vector machine for classification

Cites work

• 10.1162/15324430152748218
• A finite newton method for classification
• An efficient weighted Lagrangian twin support vector machine for imbalanced data classification
• Fuzzy Twin Support Vector Machines for Pattern Classification
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• Large-scale linear nonparallel support vector machine solver
• Linear programming twin support vector regression
• Nonlinear complementarity as unconstrained and constrained minimization
• Pattern classification.
• SSVM: A smooth support vector machine for classification
• Statistical comparisons of classifiers over multiple data sets
• Support-vector networks
• TSVR: an efficient twin support vector machine for regression

Cited in

(7)

• Smooth augmented Lagrangian method for twin bounded support vector machine
• General twin support vector machine with pinball loss function
• scientific article; zbMATH DE number 5430994 (Why is no real title available?)
• A polynomial smooth twin support vector machines based on Newton-Armijo optimization
• A method of dimensionality reduction by selection of components in principal component analysis for text classification
• On Lagrangian L2-norm pinball twin bounded support vector machine via unconstrained convex minimization
• Comprehensive review on twin support vector machines

Describes a project that uses

Uses Software

• LIBSVM
• UCI
• SSVM
• RSVM

This page was built for publication: Smooth twin support vector machines via unconstrained convex minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156282)