.png){kind=icon}
.png){kind=icon}
Return
Adaptive kernel principal component analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2009.11.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
An adaptive kernel principal component analysis (AKPCA) method, which has the flexibility to accurately track the kernel principal components (KPC), is presented. The contribution of this paper may be divided into two parts. First, KPC are recursively formulated to overcome the batch nature of standard kernel principal component analysis (KPCA). This formulation is derived from the recursive eigendecomposition of kernel covariance matrix and indicates the KPC variation caused by the new data. Second, kernel covariance matrix is correctly updated to adapt to the changing characteristics of data. In this adaptive method, the KPC is adaptively adjusted without re-eigendecomposing the kernel Gram matrix. The proposed method not only maintains constant update speed and memory usage as the data-size increases, but also alleviates sub-optimality of the KPCA method for non-stationary data. Experiments for simulation data and real applications are detailed to assess the utility of the proposed method. The results demonstrate that our approach yields improvements in terms of both computational speed and approximation accuracy. Crown Copyright (C) 2009 Published by Elsevier B.V. All rights reserved.
Keywords:
Adaptive method
Kernel principal component analysis
Kernel principal component
Non-stationary data
Recursive algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.9K
Citations:
1.7W