A fast sparse algorithm for least squares support vector machine based on global representative points

DOI10.16383/J.AAS.2017.C150720MaRDI QIDQ5367548zbMATH OpenWikidataFDO

Authors Yuefeng Ma, Xun Liang, Xiaoping Zhou

Publication date 20 October 2017

Full work available at URL https://doi.org/10.16383/J.AAS.2017.C150720

zbMATH Keywords

global discrete degreeglobal representative pointleast squares support vector machinelocal densitysparseness

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A sparse least squares support vector machine
• A novel sparse least squares support vector machines
• A high sparseness least squares support vector machine classifier
• scientific article; zbMATH DE number 1928693
• Training sparse least squares support vector machines by the QR decomposition

Cited in

(2)

• An improved scheme for fast approximation to least squares support vector regression
• Modeling method of least squares support vector regression based on vector base learning

This page was built for publication: A fast sparse algorithm for least squares support vector machine based on global representative points

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