暂无分享,去创建一个
Aditya Bhaskara | Morteza Zadimoghaddam | Gang Fu | Vahab S. Mirrokni | Afshin Rostamizadeh | Jason Altschuler | Jason M. Altschuler | Afshin Rostamizadeh | V. Mirrokni | Aditya Bhaskara | Morteza Zadimoghaddam | G. Fu
[1] S. Muthukrishnan,et al. Relative-Error CUR Matrix Decompositions , 2007, SIAM J. Matrix Anal. Appl..
[2] Dan Feldman,et al. Dimensionality Reduction of Massive Sparse Datasets Using Coresets , 2015, NIPS.
[3] Venkatesan Guruswami,et al. Optimal column-based low-rank matrix reconstruction , 2011, SODA.
[4] Christos Boutsidis,et al. Near Optimal Column-Based Matrix Reconstruction , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[5] Huy L. Nguyen,et al. The Power of Randomization: Distributed Submodular Maximization on Massive Datasets , 2015, ICML.
[6] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[7] Michael B. Cohen,et al. Dimensionality Reduction for k-Means Clustering and Low Rank Approximation , 2014, STOC.
[8] Dan Feldman,et al. Turning big data into tiny data: Constant-size coresets for k-means, PCA and projective clustering , 2013, SODA.
[9] Mohamed S. Kamel,et al. An Efficient Greedy Method for Unsupervised Feature Selection , 2011, 2011 IEEE 11th International Conference on Data Mining.
[10] Mohamed S. Kamel,et al. A Fast Greedy Algorithm for Generalized Column Subset Selection , 2013, ArXiv.
[11] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[12] Morteza Zadimoghaddam,et al. Randomized Composable Core-sets for Distributed Submodular Maximization , 2015, STOC.
[13] Maria-Florina Balcan,et al. Distributed k-means and k-median clustering on general communication topologies , 2013, NIPS.
[14] Chih-Jen Lin,et al. LIBLINEAR: A Library for Large Linear Classification , 2008, J. Mach. Learn. Res..
[15] Santosh S. Vempala,et al. Matrix approximation and projective clustering via volume sampling , 2006, SODA '06.
[16] Mohamed S. Kamel,et al. Greedy column subset selection for large-scale data sets , 2014, Knowledge and Information Systems.
[17] Andreas Krause,et al. Lazier Than Lazy Greedy , 2014, AAAI.
[18] Tamás Sarlós,et al. Improved Approximation Algorithms for Large Matrices via Random Projections , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[19] Christos Boutsidis,et al. An improved approximation algorithm for the column subset selection problem , 2008, SODA.
[20] Vahab S. Mirrokni,et al. Composable core-sets for diversity and coverage maximization , 2014, PODS.
[21] Zhihua Zhang,et al. A Scalable Approach to Column-Based Low-Rank Matrix Approximation , 2013, IJCAI.
[22] Yingyu Liang,et al. Distributed k-Means and k-Median Clustering on General Topologies , 2013, NIPS 2013.
[23] Christos Boutsidis,et al. Greedy Minimization of Weakly Supermodular Set Functions , 2015, APPROX-RANDOM.
[24] Isabelle Guyon,et al. An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..
[25] M. Rudelson,et al. Non-asymptotic theory of random matrices: extreme singular values , 2010, 1003.2990.
[26] Santosh S. Vempala,et al. Adaptive Sampling and Fast Low-Rank Matrix Approximation , 2006, APPROX-RANDOM.
[27] Christos Boutsidis,et al. Communication-optimal Distributed Principal Component Analysis in the Column-partition Model , 2015, ArXiv.
[28] Luis Rademacher,et al. Efficient Volume Sampling for Row/Column Subset Selection , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[29] Alan M. Frieze,et al. Fast Monte-Carlo algorithms for finding low-rank approximations , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[30] Ali Çivril,et al. Column Subset Selection Problem is UG-hard , 2014, J. Comput. Syst. Sci..
[31] Alan M. Frieze,et al. Clustering Large Graphs via the Singular Value Decomposition , 2004, Machine Learning.
[32] Alan M. Frieze,et al. Fast monte-carlo algorithms for finding low-rank approximations , 2004, JACM.
[33] Malik Magdon-Ismail,et al. Column subset selection via sparse approximation of SVD , 2012, Theor. Comput. Sci..