Abstract

In this paper, we propose a novel feature extraction method for pattern classification problem. We propose to map the original data to subspaces for feature extraction and hope the mapped data can reconstruct the original data. The motive is to avoid of losing of information of the original data in the process of subspace mapping. We assume that if the original data can be reconstructed from the subspace, the critical information can be preserved. Moreover, we also observed that the reconstruction error is a low-rank matrix if the reconstruction is performed well. We propose to measure the reconstruction error matrix rank by the nuclear norm and minimize it to learn the optimal subspace transformation matrix. Meanwhile, the classification is also used to regularize the learning to improve the discriminate ability of the subspace representations. Experiments over several benchmark data sets show the advantage of the proposed method over the existing subspace learning methods.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

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.