On Lagrangian L2-norm pinball twin bounded support vector machine via unconstrained convex minimization

DOI10.1016/j.ins.2021.04.031OpenAlexW3154818504MaRDI QIDQ6092065

S. Balasundaram, Subhash Chandra Prasad

Publication date: 23 November 2023

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2021.04.031

zbMATH Keywords

classificationpinball losshinge losstwin bounded support vector machine

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Estimating conditional quantiles with the help of the pinball loss
• Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
• SVM-based feature extraction for face recognition
• Asymmetric least squares support vector machine classifiers
• TPMSVM: A novel twin parametric-margin support vector machine for pattern recognition
• A \(\nu \)-twin support vector machine (\(\nu \)-TSVM) classifier and its geometric algorithms
• 10.1162/15324430152748218
• Parallel Gradient Distribution in Unconstrained Optimization
• Gene selection for cancer classification using support vector machines

This page was built for publication: On Lagrangian L2-norm pinball twin bounded support vector machine via unconstrained convex minimization