Efficient implicit Lagrangian twin parametric insensitive support vector regression via unconstrained minimization problems
From MaRDI portal
Publication:2035635
DOI10.1007/s10472-020-09708-0OpenAlexW3101040187MaRDI QIDQ2035635
Bharat Richhariya, Deepak Gupta
Publication date: 25 June 2021
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-020-09708-0
regression estimationsupport vector regressionunconstrained convex minimizationparametric insensitive modeltwin support vector regression
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Least squares recursive projection twin support vector machine for classification
- An efficient weighted Lagrangian twin support vector machine for imbalanced data classification
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- An iterative algorithm learning the maximal margin classifier.
- TWSVR: regression via twin support vector machine
- Knowledge transfer in SVM and neural networks
- New support vector algorithms with parametric insensitive/margin model
- TSVR: an efficient twin support vector machine for regression
- Support-vector networks
- Nonlinear black-box modeling in system identification: A unified overview
- A general soft method for learning SVM classifiers with \(L_{1}\)-norm penalty
- Fuzzy Twin Support Vector Machines for Pattern Classification
- 10.1162/15324430152748218
- A finite newton method for classification
- SSVM: A smooth support vector machine for classification
This page was built for publication: Efficient implicit Lagrangian twin parametric insensitive support vector regression via unconstrained minimization problems