Robust principal component analysis with non-greedy ℓ1-norm maximization

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2011, Pages 1433-1438

  Nie, Feiping ^a   Huang, Heng ^a   Ding, Chris ^a   Luo, Dijun ^a   Wang, Hua ^a  

^a University of Texas at Arlington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GREEDY METHOD; GREEDY STRATEGIES; HIGH DIMENSIONAL DATA; HIGH DIMENSIONALITY; LARGE SCALE DATA; MAXIMIZATION PROBLEM; REAL-WORLD DATASETS; ROBUST PRINCIPAL COMPONENT ANALYSIS;

ARTIFICIAL INTELLIGENCE; STATISTICS;

PRINCIPAL COMPONENT ANALYSIS;

EID: 84881045247     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.5591/978-1-57735-516-8/IJCAI11-242     Document Type: Conference Paper

References (21)

1. H. Aanas, R. Fisker, K. Astrom, and J.M. Carstensen. Robust factorization. IEEE Transactions on PAMI, 24(9):1215-1225, 2002. (Pubitemid 35242582)
2. A. Baccini, P. Besse, and A. de Faguerolles. A L1-norm PCA and heuristic approach. In Proceedings of the International Conference on Ordinal and Symbolic Data Analysis, volume 1, pages 359-368, 1996.
3. S.P. Boyd and L. Vandenberghe. Convex optimization. Cambridge University Press, 2004.
4. F. De La Torre and M.J. Black. A framework for robust subspace learning. International Journal of Computer Vision, 54(1):117-142, 2003.
5. Chris H. Q. Ding, Ding Zhou, Xiaofeng He, and Hongyuan Zha. R1-PCA: rotational invariant L1-norm principal component analysis for robust subspace factorization. In ICML, pages 281-288, 2006.
6. David L. Donoho. Compressed sensing. IEEE Transactions on Information Theory, 52(4):1289-1306, 2006.
7. J.S. Galpin and D.M. Hawkins. Methods of L1 estimation of a covariance matrix. Computational Statistics & Data Analysis, 5(4):305-319, 1987.
8. Heng Huang and Chris H. Q. Ding. Robust tensor factorization using r1 norm. In CVPR, 2008.
9. Q. Ke and T. Kanade. Robust L1 norm factorization in the presence of outliers and missing data by alternative convex programming. In CVPR, pages 739-746, 2005. (Pubitemid 43897268)
10. N. Kwak. Principal component analysis based on L1-norm maximization. IEEE Transactions on PAMI, 30(9):1672-1680, 2008.
11. Lieven De Lathauwer. Signal Processing based on Multilinear Algebra. PhD thesis, Faculteit der Toegepaste Wetenschappen. Katholieke Universiteit Leuven, 1997.
12. Xuelong Li, Yanwei Pang, and Yuan Yuan. L1-norm-based 2DPCA. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 38(4), 2010.
13. Yang Liu, Yan Liu, and Keith C. C. Chan. Multilinear maximum distance embedding via l1-norm optimization. In AAAI, 2010.
14. 2,1-norms minimization. In NIPS, 2010.
15. Feiping Nie, Dong Xu, Ivor Wai-Hung Tsang, and Changshui Zhang. Flexible manifold embedding: A framework for semi-supervised and unsupervised dimension reduction. IEEE Transactions on Image Processing, 19(7):1921-1932, 2010.
16. Yanwei Pang, Xuelong Li, and Yuan Yuan. Robust tensor analysis with L1-norm. IEEE Transactions on Circuits and Systems for Video Technology, 20(2):172-178, 2010.
17. Bernhard Schölkopf, Alex J. Smola, and Klaus-Robert Müller. Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5):1299-1319, 1998.
18. J. Wright, A. Ganesh, S. Rao, and Y. Ma. Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization. NIPS, 2009.
19. Shiming Xiang, Feiping Nie, and Changshui Zhang. Learning a mahalanobis distance metric for data clustering and classification. Pattern Recognition, 41(12):3600-3612, 2008.
20. Yi Yang, Yueting Zhuang, Dong Xu, Yunhe Pan, Dacheng Tao, and Stephen J. Maybank. Retrieval based interactive cartoon synthesis via unsupervised bi-distance metric learning. In ACM Multimedia, pages 311-320, 2009.
21. Changshui Zhang, Feiping Nie, and Shiming Xiang. A general kernelization framework for learning algorithms based on kernel PCA. Neurocomputing, 73(4-6):959-967, 2010.