Journal
IET COMPUTER VISION
Volume 7, Issue 1, Pages 48-55Publisher
INST ENGINEERING TECHNOLOGY-IET
DOI: 10.1049/iet-cvi.2011.0193
Keywords
-
Funding
- National Science Foundation of China [60973098]
- National Science Fund for Distinguished Young Scholars [61125305]
Ask authors/readers for more resources
The feature vectors in feature space are more likely to be linearly separable than the observations in input space. To enhance the separability of the feature vectors, the authors perform least absolute shrinkage and selection operator (LASSO) regression in the reproducing kernel Hilbert space and develop a kernel LASSO regression classifier (LASSO-KRC). Based on the theory of calculus, least squares optimisation with L1-norm regularised constraints can be reformulated into another equivalent form. Without an explicit mapping function, the solution to the optimisation problem can be obtained by solving a convex optimisation problem with any symmetric kernel function. LASSO-KRC is applied to pattern classification and appears to outperform nearest neighbour classifier, minimum distance classifier, sparse representation classifier and linear regression classifier.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available