- Title
- On low-rank regularized least squares for scalable nonlinear classification
- Creator
- Fu, Zhouyu; Lu, Guojun; Ting, Kaiming; Zhang, Dengsheng
- Date
- 2011
- Type
- Text; Conference paper
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/74314
- Identifier
- vital:7243
- Identifier
-
https://doi.org/10.1007/978-3-642-24958-7_57
- Identifier
- ISBN:9783642249570
- Abstract
- In this paper, we revisited the classical technique of Regularized Least Squares (RLS) for the classification of large-scale nonlinear data. Specifically, we focus on a low-rank formulation of RLS and show that it has linear time complexity in the data size only and does not rely on the number of labels and features for problems with moderate feature dimension. This makes low-rank RLS particularly suitable for classification with large data sets. Moreover, we have proposed a general theorem for the closed-form solutions to the Leave-One-Out Cross Validation (LOOCV) estimation problem in empirical risk minimization which encompasses all types of RLS classifiers as special cases. This eliminates the reliance on cross validation, a computationally expensive process for parameter selection, and greatly accelerate the training process of RLS classifiers. Experimental results on real and synthetic large-scale benchmark data sets have shown that low-rank RLS achieves comparable classification performance while being much more efficient than standard kernel SVM for nonlinear classification. The improvement in efficiency is more evident for data sets with higher dimensions.
- Publisher
- Springer-verlag
- Relation
- International Conference on Neural Information Processing p. 490-499
- Rights
- This metadata is freely available under a CCO license
- Subject
- Classification; Regularized least squares; Low-rank approximation; 0801 Artificial Intelligence and Image Processing
- Reviewed
- Hits: 1570
- Visitors: 1572
- Downloads: 2
| Thumbnail | File | Description | Size | Format |
|---|