An efficient algorithm for sliding window based incremental principal components analysis
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.
Abstract
It is computationally expensive to compute principal components from scratch at every update or downdate when new data arrive and existing data are truncated from the data matrix frequently. To overcome this limitations, incremental principal component analysis is considered. Specifically, we present a sliding window based efficient incremental principal component computation from a covariance matrix which comprises of two procedures; simultaneous update and downdate of principal components, followed by the rank-one matrix update. Additionally we track the accurate decomposition error and the adaptive numerical rank. Experiments show that the proposed algorithm enables a faster execution speed and no-meaningful decomposition error differences compared to typical incremental principal component analysis algorithms, thereby maintaining a good approximation for the principal components.
참고문헌 (9)
- H. Abdi, "Principal component analysis", Wiley Interdiscip. Rev. Com-put. Stat., 2(4), pp.433~459 (2010)
- R. Badeau, "Sliding window adaptive SVD algorithms", IEEE Trans. Signal Process, 52(1), pp.1~10 (2004)[DOI]
- J. L. Barlow, "Improved Gram-Schmidt type downdating methods", BIT, 45(2), pp.259~285 (2005)[DOI]
- M. Brand, "Fast low-rank modications of the thin singular value decomposition", Linear Algebra Appl, 415(1), pp.20~30 (2006)[DOI]
- J. R. Bunch, "Updating the singular value decomposition", Numer. Math, 31(2), pp.111~129 (1978)[DOI]
- Y. Li, "An integreted algorithm of incremental and robust PCA", Proc. Int. Conf. on Image Processing, pp.245~248 (2003)
- C. Pehlevan, "A Hebbian", anti-Hebbian neural network for linear subspace learning: a derivation from multidimensional scaling of streaming data, 2015, pp.27(7), 1461~1495
- J. Weng, "Candid covariance-free incremental principal component analysis", IEEE Trans. Pattern Anal. Mach. Intell, 25(8), pp.1034~1040 (2003)
- H. Zhao, "A novel incremental principal component analysis and its application for face recognition", IEEE Trans. on Sys. Man, and Cybernetics, 36(4), pp.873~886 (2006)