Abstract
AbstractPrincipal Component Analysis (PCA) is one of the most widely used data analysis methods in machine learning and AI. This manuscript focuses on the mathematical foundation of classical PCA and its application to a small-sample-size scenario and a large dataset in a high-dimensional space scenario. In particular, we discuss a simple method that can be used to approximate PCA in the latter case. This method can also help approximate kernel PCA or kernel PCA (KPCA) for a large-scale dataset. We hope this manuscript will give readers a solid foundation on PCA, approximate PCA, and approximate KPCA.
Funder
The Program Management Unit for Human Resources & Institutional Development, Research and Innovation
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Reference33 articles.
1. Adelomou PA, Fauli DC, RibÃÂÆÂ’ EG, Vilasis-Cardona X (2022) Quantum case-based reasoning (qCBR). Artif Intell Rev, pp 1–27
2. Barla A, Odone F, Verri A (2003) Histogram intersection kernel for image classification. In: Proceedings 2003 International Conference on Image Processing (Cat. No.03CH37429), vol 3, pp 3–513
3. Bertsekas DP (1996) Constrained optimization and lagrange multiplier methods. Athena Scientific, Belmort
4. Blum A, Hopcroft J, Kannan R (2017) Foundations of data science
5. Boughorbel S, Tarel JP, Boujemaa N.(2005) Generalized histogram intersection kernel for image recognition. In: IEEE international conference on image processing 2005, vol 3, pp 3–161
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献