A Scalable Approach to Column-Based Low-Rank Matrix Approximation
暂无分享,去创建一个
[1] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[2] Santosh S. Vempala,et al. Spectral Algorithms , 2009, Found. Trends Theor. Comput. Sci..
[3] Kenneth Y. Goldberg,et al. Eigentaste: A Constant Time Collaborative Filtering Algorithm , 2001, Information Retrieval.
[4] Gene H. Golub,et al. Matrix computations , 1983 .
[5] Petros Drineas,et al. Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition , 2006, SIAM J. Comput..
[6] Michael W. Mahoney. Randomized Algorithms for Matrices and Data , 2011, Found. Trends Mach. Learn..
[7] Edward Y. Chang,et al. A data-driven study of image feature extraction and fusion , 2014, Inf. Sci..
[8] L. Babai,et al. Theory of Computing , 2015 .
[9] Nathan Halko,et al. Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions , 2009, SIAM Rev..
[10] Thomas Serre,et al. Robust Object Recognition with Cortex-Like Mechanisms , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[11] Malik Magdon-Ismail,et al. Column subset selection via sparse approximation of SVD , 2012, Theor. Comput. Sci..
[12] Petros Drineas,et al. Pass efficient algorithms for approximating large matrices , 2003, SODA '03.
[13] Eugene E. Tyrtyshnikov,et al. Incomplete Cross Approximation in the Mosaic-Skeleton Method , 2000, Computing.
[14] Per-Gunnar Martinsson,et al. On the Compression of Low Rank Matrices , 2005, SIAM J. Sci. Comput..
[15] Christos Boutsidis,et al. Near-Optimal Column-Based Matrix Reconstruction , 2014, SIAM J. Comput..
[16] Santosh S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, SODA '06.
[17] J. Meigs,et al. WHO Technical Report , 1954, The Yale Journal of Biology and Medicine.
[18] Ming Gu,et al. Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization , 1996, SIAM J. Sci. Comput..
[19] S. Goreinov,et al. Pseudo-skeleton approximations by matrices of maximal volume , 1997 .
[20] David J. Kriegman,et al. Acquiring linear subspaces for face recognition under variable lighting , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[21] Petros Drineas,et al. On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning , 2005, J. Mach. Learn. Res..
[22] S. Goreinov,et al. A Theory of Pseudoskeleton Approximations , 1997 .
[23] Ameet Talwalkar,et al. Divide-and-Conquer Matrix Factorization , 2011, NIPS.
[24] S. Muthukrishnan,et al. Relative-Error CUR Matrix Decompositions , 2007, SIAM J. Matrix Anal. Appl..
[25] John Wright,et al. RASL: Robust Alignment by Sparse and Low-Rank Decomposition for Linearly Correlated Images , 2012, IEEE Trans. Pattern Anal. Mach. Intell..
[26] Craig Chambers,et al. FlumeJava: easy, efficient data-parallel pipelines , 2010, PLDI '10.
[27] Petros Drineas,et al. CUR matrix decompositions for improved data analysis , 2009, Proceedings of the National Academy of Sciences.
[28] David P. Woodruff,et al. Low rank approximation and regression in input sparsity time , 2013, STOC '13.
[29] Vittorio Ferrari,et al. Advances in Neural Information Processing Systems 24 , 2011 .
[30] Dinh Phung,et al. Journal of Machine Learning Research: Preface , 2014 .
[31] David P. Woodruff,et al. Low rank approximation and regression in input sparsity time , 2012, STOC '13.
[32] Christos Boutsidis,et al. An improved approximation algorithm for the column subset selection problem , 2008, SODA.
[33] David J. Kriegman,et al. From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose , 2001, IEEE Trans. Pattern Anal. Mach. Intell..