Skip to main content
Springer Nature Link
Log in

An Improved Algorithm for Kernel Principal Component Analysis

  • Published:
Neural Processing Letters Aims and scope Submit manuscript

Abstract

Kernel principal component analysis (KPCA), introduced by Schölkopf et al., is a nonlinear generalization of the popular principal component analysis (PCA) via the kernel trick. KPCA has shown to be a very powerful approach of extracting nonlinear features for classification and regression applications. However, the standard KPCA algorithm (Schölkopf et al., 1998, Neural Computation 10, 1299–1319) may suffer from computational problem for large scale data set. To overcome these drawbacks, we propose an efficient training algorithm in this paper, and show that this approach is of much more computational efficiency compared to the previous ones for KPCA.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Abbreviations

EM:

Expectation Maximization

KPCA:

Kernel Principal Component Analysis

PCA:

Principal Component Analysis

Reference

  1. B. Schölkopf A. Smola K.R. Müller (1998) ArticleTitleNonlinear component analysis as a kernel eigenvalue problem Neural Computation 10 1299–1319 Occurrence Handle10.1162/089976698300017467

    Article  Google Scholar 

  2. I.T. Jolliffe (1986) Principal Component Analysis Springer-Verlag New York

    Google Scholar 

  3. R. Rosipal M. Girolami L. Trejo A. Cichocki (2001) ArticleTitleKernel PCA for feature extraction and de-noising in nonlinear regression Neural Computing & Application 10 231–243

    Google Scholar 

  4. R. Rosipal M. Girolami (2001) ArticleTitleAn expectation-maximization approach to nonlinear component analysis Neural Computation 13 505–510 Occurrence Handle10.1162/089976601300014439

    Article  Google Scholar 

  5. F.M. Ham I. Kostanic (2001) Principles of Neurocomputing for Science and Engineering McGraw-Hill Companies, Inc New York

    Google Scholar 

  6. W. Zheng L. Zhao C. Zou (2004) ArticleTitleLocally nearest neighbor classifiers for pattern classification Pattern Recognition 37 1307–1309 Occurrence Handle10.1016/j.patcog.2003.11.004

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center for Learning Science, Southeast University, Nanjing, Jiangsu, 210096, People’s Republic of China

    Wenming Zheng

  2. Engineering Research Center of Information Processing and Application, Southeast University, Nanjing, Jiangsu, 210096, People’s Republic of China

    Cairong Zou & Li Zhao

Authors
  1. Wenming Zheng
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Cairong Zou
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Li Zhao
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Wenming Zheng.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zheng, W., Zou, C. & Zhao, L. An Improved Algorithm for Kernel Principal Component Analysis. Neural Process Lett 22, 49–56 (2005). https://doi.org/10.1007/s11063-004-0036-x

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11063-004-0036-x

Keywords