Design of a multiple kernel learning algorithm for LS-SVM by convex programming
From MaRDI portal
Publication:553288
DOI10.1016/j.neunet.2011.03.009zbMath1217.68185OpenAlexW1988486039WikidataQ51585320 ScholiaQ51585320MaRDI QIDQ553288
Zhonghang Xia, Ling Jian, Chuanhou Gao, Xi-Jun Liang
Publication date: 26 July 2011
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2011.03.009
quadratically constrained quadratic programmingconvex optimizationsemidefinite programmingleast squares support vector machinesmultiple kernel learning
Related Items (4)
Fast prediction with sparse multikernel LS-SVR using multiple relevant time series and its application in avionics system ⋮ Feature selection and multi-kernel learning for sparse representation on a manifold ⋮ Structural multiple empirical kernel learning ⋮ MREKLM: a fast multiple empirical kernel learning machine
Uses Software
Cites Work
- Benchmarking least squares support vector machine classifiers
- Model selection for the LS-SVM. Application to handwriting recognition
- Perturbation analysis of generalized saddle point systems
- Low rank updated LS-SVM classifiers for fast variable selection
- Kernel based support vector machine via semidefinite programming: application to medical diagnosis
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Chaos control using least-squares support vector machines
- Semidefinite Programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Design of a multiple kernel learning algorithm for LS-SVM by convex programming