论文信息 - Learning of robust principal component subspace

Learning of robust principal component subspace

We study various neural algorithms for learning so-called robust principal component subspace. Standard principal components and the corresponding subspace are defined in terms of quadratic optimization criteria, leading to algorithms having linear learning term. The robust algorithms are derived by optimizing a similar criterion that grows less that quadratically. This introduces a nonlinearity into the gradient algorithms, but makes the results more robust against strong noise and outliers.

Juha Karhunen | Jyrki Joutsensalo | J. Karhunen | J. Joutsensalo | J. Joutsensalo

[1] D. O’Leary. Robust regression computation computation using iteratively reweighted least squares , 1990 .

[2] Gene H. Golub,et al. Matrix computations , 1983 .

[3] L. E. Russo. An outer product neural network for extracting principal components from a time series , 1991, Neural Networks for Signal Processing Proceedings of the 1991 IEEE Workshop.

[4] Anders Krogh,et al. Introduction to the theory of neural computation , 1994, The advanced book program.

[5] Juha Karhunen,et al. Representation and separation of signals using nonlinear PCA type learning , 1994, Neural Networks.

[6] Lei Xu. Least MSE reconstruction for self-organization. II. Further theoretical and experimental studies on one-layer nets , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[7] Erkki Oja,et al. Principal components, minor components, and linear neural networks , 1992, Neural Networks.