Abstract

A new incremental kernel principal component analysis is proposed for the nonlinear feature extraction from the data. The problem of batch kernel principal component analysis is that the computation becomes prohibitive when the data set is large . Another problem is that, in order to update the eigenvectors with another data, the whole decomposition from scratch should be recomputed. The proposed method overcomes these problems by incrementally update eigenspace and using empirical kernel map as kernel function. The proposed method is more efficient in memory requirement than a batch kernel principal component and can be easily improved by re-learning the data. In our experiments we show that proposed method is comparable in performance to a batch kernel principal component for the classification problem on nonlinear data set.

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.