Abstract
In this paper, we propose an efficient nonlinear feature extraction method using kernel-based minimum squared error (KMSE). This improved method is referred to as reformative KMSE (RKMSE). In RKMSE, we use a linear combination of a small portion of samples that are selected from the training sample set, i.e. “significant nodes”, to approximate to the transform vector of KMSE in kernel space. As a result, RKMSE is much superior to naive KMSE in computational efficiency of feature extraction. Experimental results on several benchmark datasets illustrate that RKMSE can efficiently classify the data with high recognition correct rate.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.