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

DOI10.1007/S11859-015-1094-9zbMATH Open1340.65065OpenAlexW2281838364MaRDI QIDQ3461640FDOQ3461640

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

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

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)

Cites Work

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

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)