GoDec: Randomized Lowrank & Sparse Matrix Decomposition in Noisy Case
暂无分享,去创建一个
[1] Dale Schuurmans,et al. Real-Time Discriminative Background Subtraction , 2011, IEEE Transactions on Image Processing.
[2] Dacheng Tao,et al. Multi-label Subspace Ensemble , 2012, AISTATS.
[3] Dacheng Tao,et al. Labelset anchored subspace ensemble (LASE) for multi-label annotation , 2012, ICMR.
[4] Emmanuel J. Candès,et al. A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..
[5] Sam T. Roweis,et al. EM Algorithms for PCA and SPCA , 1997, NIPS.
[6] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[7] E. Candès,et al. Compressed sensing and robust recovery of low rank matrices , 2008, 2008 42nd Asilomar Conference on Signals, Systems and Computers.
[8] Pablo A. Parrilo,et al. Rank-Sparsity Incoherence for Matrix Decomposition , 2009, SIAM J. Optim..
[9] Sewoong Oh,et al. A Gradient Descent Algorithm on the Grassman Manifold for Matrix Completion , 2009, ArXiv.
[10] Xiaodong Li,et al. Stable Principal Component Pursuit , 2010, 2010 IEEE International Symposium on Information Theory.
[11] Xindong Wu,et al. Manifold elastic net: a unified framework for sparse dimension reduction , 2010, Data Mining and Knowledge Discovery.
[12] Adrian S. Lewis,et al. Alternating Projections on Manifolds , 2008, Math. Oper. Res..
[13] Dirk A. Lorenz,et al. Iterated Hard Shrinkage for Minimization Problems with Sparsity Constraints , 2008, SIAM J. Sci. Comput..
[14] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[15] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.