Two-Phase Incremental Kernel PCA for Learning Massive or Online Datasets

• Main Authors: Feng Zhao, Islem Rekik, Seong-Whan Lee, Jing Liu, Junying Zhang, Dinggang Shen
• Format: Article
• Language: English
• Published: Hindawi-Wiley 2019-01-01
• Series: Complexity
• Online Access: http://dx.doi.org/10.1155/2019/5937274

As a powerful nonlinear feature extractor, kernel principal component analysis (KPCA) has been widely adopted in many machine learning applications. However, KPCA is usually performed in a batch mode, leading to some potential problems when handling massive or online datasets. To overcome this drawback of KPCA, in this paper, we propose a two-phase incremental KPCA (TP-IKPCA) algorithm which can incorporate data into KPCA in an incremental fashion. In the first phase, an incremental algorithm is developed to explicitly express the data in the kernel space. In the second phase, we extend an incremental principal component analysis (IPCA) to estimate the kernel principal components. Extensive experimental results on both synthesized and real datasets showed that the proposed TP-IKPCA produces similar principal components as conventional batch-based KPCA but is computationally faster than KPCA and its several incremental variants. Therefore, our algorithm can be applied to massive or online datasets where the batch method is not available.