Journal of Jilin University Science Edition
Previous Articles Next Articles
ZHOU Shuisheng, ZHOU Yanling, YAO Dan, WANG Baojun
Received:
Online:
Published:
Contact:
Abstract: The traditional least squares support vector machine (LSSVM) obtained the low rank of kernel matrix by randomly choosing a part of samples to improve the sparsity of solution. In order to make the approximate decomposition of low rank matrix as small as possible to approximate the original kernel matrix, we proposed QRPLSSVM sparse algorithm based on QR factorization. Using the orthogonal feature of QR factorization to choose some samples with a big diversity, we iteratively selected some columns of the kernel matrix to get Nystrm type low rank approximation of kernel matrix, and used decomposition results to get the sparse solution of LSSVM quickly. The experimental analyses show that the proposed algorithm can get more sparse solutions without sacrificing the classification performance, and even get higher accuracy with the sparsity level less than 0.05%, and it can solve largescale training problems effectively.
Key words: sparse least square support vector machine (LSSVM), sparse solution, QR factorization
CLC Number:
ZHOU Shuisheng, ZHOU Yanling, YAO Dan, WANG Baojun. Sparse LSSVM Algorithm Based on QR Factorization[J].Journal of Jilin University Science Edition, 2018, 56(2): 347-354.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: http://xuebao.jlu.edu.cn/lxb/EN/
http://xuebao.jlu.edu.cn/lxb/EN/Y2018/V56/I2/347
Cited