Online Principal Component Analysis in High Dimension: Which Algorithm\n to Choose?

Hervé Cardot, David Degras

arXiv (Cornell University) · 2015 · 97 citations · 34 references

DOIFull text

Open access

Concepts

Abstract

In the current context of data explosion, online techniques that do not\nrequire storing all data in memory are indispensable to routinely perform tasks\nlike principal component analysis (PCA). Recursive algorithms that update the\nPCA with each new observation have been studied in various fields of research\nand found wide applications in industrial monitoring, computer vision,\nastronomy, and latent semantic indexing, among others. This work provides\nguidance for selecting an online PCA algorithm in practice. We present the main\napproaches to online PCA, namely, perturbation techniques, incremental methods,\nand stochastic optimization, and compare their statistical accuracy,\ncomputation time, and memory requirements using artificial and real data.\nExtensions to missing data and to functional data are discussed. All studied\nalgorithms are available in the R package onlinePCA on CRAN.\n

References

34