An efficient algorithm for L1-norm principal component analysis
暂无分享,去创建一个
[1] Takeo Kanade,et al. Robust L/sub 1/ norm factorization in the presence of outliers and missing data by alternative convex programming , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[2] Nojun Kwak,et al. Principal Component Analysis Based on L1-Norm Maximization , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[3] W. Krzanowski,et al. A Characterization of Principal Components for Projection Pursuit , 1999 .
[4] D. Hawkins,et al. Methods of L1 estimation of a covariance matrix , 1987 .
[5] Michael J. Black,et al. A Framework for Robust Subspace Learning , 2003, International Journal of Computer Vision.
[6] Dimitri P. Bertsekas,et al. Nonlinear Programming , 1997 .
[7] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[8] Junbin Gao,et al. Robust L1 Principal Component Analysis and Its Bayesian Variational Inference , 2008, Neural Computation.
[9] R. Tibshirani,et al. Sparse Principal Component Analysis , 2006 .
[11] Chris H. Q. Ding,et al. R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization , 2006, ICML.
[12] Philippe C. Besse,et al. A L 1-norm PCA and a Heuristic Approach , 1996 .