Two-Phase Incremental Kernel PCA for Learning Massive or Online Datasets
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhao, Feng | - |
dc.contributor.author | Rekik, Islem | - |
dc.contributor.author | Lee, Seong-Whan | - |
dc.contributor.author | Liu, Jing | - |
dc.contributor.author | Zhang, Junying | - |
dc.contributor.author | Shen, Dinggang | - |
dc.date.accessioned | 2021-12-16T05:40:48Z | - |
dc.date.available | 2021-12-16T05:40:48Z | - |
dc.date.created | 2021-08-30 | - |
dc.date.issued | 2019 | - |
dc.identifier.issn | 1076-2787 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/131727 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | WILEY-HINDAWI | - |
dc.subject | PRINCIPAL COMPONENT ANALYSIS | - |
dc.subject | ALGORITHM | - |
dc.title | Two-Phase Incremental Kernel PCA for Learning Massive or Online Datasets | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Seong-Whan | - |
dc.contributor.affiliatedAuthor | Shen, Dinggang | - |
dc.identifier.doi | 10.1155/2019/5937274 | - |
dc.identifier.scopusid | 2-s2.0-85062375049 | - |
dc.identifier.wosid | 000459670500001 | - |
dc.identifier.bibliographicCitation | COMPLEXITY | - |
dc.relation.isPartOf | COMPLEXITY | - |
dc.citation.title | COMPLEXITY | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalResearchArea | Science & Technology - Other Topics | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Multidisciplinary Sciences | - |
dc.subject.keywordPlus | PRINCIPAL COMPONENT ANALYSIS | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.