Robust transfer principal component analysis with rank constraints

Advances in Neural Information Processing Systems

Volumn , Issue , 2013, Pages

  Guo, Yuhong ^a  

^a Temple University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; OPTIMIZATION; PRINCIPAL COMPONENT ANALYSIS; RANDOM ERRORS; RECOVERY; ROBUST CONTROL;

CHALLENGE PROBLEMS; DIMENSIONALITY REDUCTION; MINIMIZATION PROBLEMS; OPTIMIZATION PROBLEMS; PRINCIPAL COMPONENT ANALYSIS METHOD; PRINCIPAL COMPONENTS; ROBUST PRINCIPAL COMPONENT ANALYSIS; WELL-ESTABLISHED TECHNIQUES;

MATRIX ALGEBRA;

EID: 84898959862     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. F. Bach. Consistency of trace norm minimization. Journal of Machine Learning Research, 9:1019-1048, 2008.
2. A. Beck and M. Teboulle. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM J. Imaging Sciences, 2, No. 1:183-202, 2009.
3. M Fazel. Matrix Rank Minimization with Applications. PhD thesis, Stanford University, 2002.
4. S. Gupta, D. Phung, B. Adams, and S. Venkatesh. Regularized nonnegative shared subspace learning. Data Mining and Knowledge Discovery, 26:57-97, 2013.
5. P. Huber. Robust Statistics. New York, New York, 1981.
6. S. Ji and J. Ye. An accelerated gradient method for trace norm minimization. In Proc. of International Conference on Machine Learning (ICML), 2009.
7. I. Jolliffe. Principal Component Analysis. Springer-Verlag, New York, New York, 1986.
8. Q. Ke and T. Kanade. Robust l1 norm factorization in the presence of outliers and missing data by alternative convex programming. In Proc. of the IEEE Conference on Computer Vision and Pattern Recognition (CVPR), 2005.
9. S. Ma, D. Goldfarb, and L. Chen. Fixed point and bregman iterative methods for matrix rank minimization. Mathematical Programming, 2009.
10. S. Pan and Q. Yang. A survey on transfer learning. IEEE Transactions on Knowledge and Data Engineering, 2010.
11. B. Recht, M. Fazel, and P. Parrilo. Guaranteed minimum rank solutions to linear matrix equations via nuclear norm minimization. SIAM Review, 52, no 3:471-501, 2010.
12. M. Tipping and C. Bishop. Probabilistic principal component analysis. Journal of the Royal Statistical Society, B, 6(3):611-622, 1999.
13. F. De La Torre andM. Black. A framework for robust subspace learning. International Journal of Computer Vision (IJCV), 54(1-3):117-142, 2003.
14. J. Wright, Y. Peng, Y. Ma, A. Ganesh, and S. Rao. Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization. In Advances in Neural Information Processing Systems (NIPS), 2009.
15. X. Zhang, Y. Yu, M. White, R. Huang, and D. Schuurmans. Convex sparse coding, subspace learning, and semi-supervised extensions. In Proc. of AAAI Conference on Artificial Intelligence (AAAI), 2011.