Abstract
This work aims to address two issues that often exist in least square regression (LSR) models for classification tasks, which are (1) learning a compact projection matrix for feature selection and (2) adopting relaxed regression targets. To this end, we first propose a sparse regularized LSR framework for feature selection by introducing the [Formula: see text] regularizer. Second, we utilize two different strategies to relax the strict regression targets based on the sparse framework. One way is to exploit the [Formula: see text]-dragging technique. Another strategy is to directly learn the labels from the inputs and constrain the distance between true and false classes simultaneously. Hence, more feasible regression schemes are constructed, and the models will be more flexible. Further, efficient iterative methods are derived to optimize the proposed models. Various experiments on image databases intend to manifest our proposed models have outstanding recognition capability compared with many state-of-the-art classifiers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Wavelets, Multiresolution and Information Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.