Optimal Sparse Linear Encoders and Sparse PCA. | 0 | 0.34 | 2016 |
Optimal principal component analysis in distributed and streaming models. | 17 | 0.61 | 2016 |
A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix. | 14 | 0.68 | 2015 |
Optimal Sparse Linear Auto-Encoders and Sparse PCA. | 3 | 0.44 | 2015 |
Communication-optimal Distributed Principal Component Analysis in the Column-partition Model. | 6 | 0.47 | 2015 |
Online principal components analysis | 1 | 0.35 | 2015 |
Spectral Clustering via the Power Method - Provably. | 10 | 0.54 | 2015 |
Greedy Minimization of Weakly Supermodular Set Functions. | 5 | 0.44 | 2015 |
Randomized Dimensionality Reduction for k-Means Clustering. | 0 | 0.34 | 2015 |
Faster SVD-truncated regularized least-squares | 8 | 0.54 | 2014 |
Near-Optimal Column-Based Matrix Reconstruction | 10 | 0.60 | 2014 |
Optimal CUR matrix decompositions | 23 | 0.87 | 2014 |
Random Projections for Linear Support Vector Machines | 15 | 0.64 | 2014 |
Fast Matrix Multiplication with Sketching. | 0 | 0.34 | 2014 |
Faster SVD-Truncated Least-Squares Regression. | 2 | 0.38 | 2014 |
Provable Deterministic Leverage Score Sampling. | 15 | 0.69 | 2014 |
A note on sparse least-squares regression | 2 | 0.42 | 2014 |
Efficient Dimensionality Reduction for Canonical Correlation Analysis. | 11 | 0.60 | 2013 |
Deterministic Feature Selection for $k$-means Clustering | 6 | 0.54 | 2013 |
Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform. | 39 | 1.50 | 2013 |
Approximate Spectral Clustering via Randomized Sketching. | 8 | 0.57 | 2013 |
Near-Optimal Coresets for Least-Squares Regression | 12 | 0.83 | 2013 |
Equity factor analysis via column subset selection. | 0 | 0.34 | 2013 |
Random Projections for Support Vector Machines | 25 | 0.92 | 2012 |
Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem | 1 | 0.35 | 2012 |
Rich Coresets For Constrained Linear Regression | 1 | 0.37 | 2012 |
On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions | 0 | 0.34 | 2012 |
Faster Subset Selection for Matrices and Applications. | 17 | 0.81 | 2012 |
Improved Low-rank Matrix Decompositions via the Subsampled Randomized Hadamard Transform | 0 | 0.34 | 2011 |
Topics in matrix sampling algorithms | 6 | 0.62 | 2011 |
Sparse Features for PCA-Like Linear Regression. | 3 | 0.42 | 2011 |
Stochastic Dimensionality Reduction for K-means Clustering | 5 | 0.47 | 2011 |
Near Optimal Column-Based Matrix Reconstruction | 45 | 1.96 | 2011 |
Random Projections for $k$-means Clustering | 37 | 1.39 | 2010 |
Unsupervised Feature Selection for the $k$-means Clustering Problem. | 42 | 1.46 | 2009 |
SVD based initialization: A head start for nonnegative matrix factorization | 149 | 6.36 | 2008 |
Random projections for the nonnegative least-squares problem | 21 | 1.61 | 2008 |
Unsupervised feature selection for principal components analysis | 48 | 2.48 | 2008 |
Clustered subset selection and its applications on it service metrics | 3 | 0.42 | 2008 |