An approximate linear solver in least square support vector machine using randomized singular value decomposition

DOI10.1007/S11859-015-1094-9MaRDI QIDQ3461640zbMATH OpenOpenAlexFDO

Authors Bing Liu, Hua Xiang

Publication date 15 January 2016

Published in Wuhan University Journal of Natural Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11859-015-1094-9

zbMATH Keywords

machine learningLanczos processleast square support vector machinerandomized singular value decompositionNyström methodlarge-scale data regression

Mathematics Subject Classification ID

Linear regression; mixed models (62J05) Learning and adaptive systems in artificial intelligence (68T05) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solutions to overdetermined systems, pseudoinverses (65F20)

Recommendations

• Efficient computations for large least square support vector machine classifiers
• A sparse least squares support vector machine
• scientific article; zbMATH DE number 2015480
• Randomized Nyström features for fast regression: an error analysis
• scientific article; zbMATH DE number 6402625

Cites work

• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 6159604 (Why is no real title available?)
• scientific article; zbMATH DE number 1391397 (Why is no real title available?)
• A tutorial on ν‐support vector machines
• Bayesian Framework for Least-Squares Support Vector Machine Classifiers, Gaussian Processes, and Kernel Fisher Discriminant Analysis
• Chaos control using least-squares support vector machines
• Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions
• Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling
• Low rank updated LS-SVM classifiers for fast variable selection
• On the Nyström method for approximating a gram matrix for improved kernel-based learning
• Regularization with randomized SVD for large-scale discrete inverse problems
• The Lanczos Algorithm with Selective Orthogonalization

Cited in

(3)

• Efficient computations for large least square support vector machine classifiers
• LS-SVM approximate solution to linear time varying descriptor systems
• Improving the solution of least squares support vector machines with application to a blast furnace system

This page was built for publication: An approximate linear solver in least square support vector machine using randomized singular value decomposition

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