Name
Affiliation
Papers
CHRISTOS BOUTSIDIS
Mathematical Sciences Department, IBM T.J. Watson Research Center, United States
39
Collaborators
Citations 
PageRank 
31
610
33.37
Referers 
Referees 
References 
1265
495
589
Search Limit
1001000
Title
Citations
PageRank
Year
Optimal Sparse Linear Encoders and Sparse PCA.00.342016
Optimal principal component analysis in distributed and streaming models.170.612016
A Randomized Algorithm for Approximating the Log Determinant of a Symmetric Positive Definite Matrix.140.682015
Optimal Sparse Linear Auto-Encoders and Sparse PCA.30.442015
Communication-optimal Distributed Principal Component Analysis in the Column-partition Model.60.472015
Online principal components analysis10.352015
Spectral Clustering via the Power Method - Provably.100.542015
Greedy Minimization of Weakly Supermodular Set Functions.50.442015
Randomized Dimensionality Reduction for k-Means Clustering.00.342015
Faster SVD-truncated regularized least-squares80.542014
Near-Optimal Column-Based Matrix Reconstruction100.602014
Optimal CUR matrix decompositions230.872014
Random Projections for Linear Support Vector Machines150.642014
Fast Matrix Multiplication with Sketching.00.342014
Faster SVD-Truncated Least-Squares Regression.20.382014
Provable Deterministic Leverage Score Sampling.150.692014
A note on sparse least-squares regression20.422014
Efficient Dimensionality Reduction for Canonical Correlation Analysis.110.602013
Deterministic Feature Selection for $k$-means Clustering60.542013
Improved Matrix Algorithms via the Subsampled Randomized Hadamard Transform.391.502013
Approximate Spectral Clustering via Randomized Sketching.80.572013
Near-Optimal Coresets for Least-Squares Regression120.832013
Equity factor analysis via column subset selection.00.342013
Random Projections for Support Vector Machines250.922012
Spectral Clustering: An empirical study of Approximation Algorithms and its Application to the Attrition Problem10.352012
Rich Coresets For Constrained Linear Regression10.372012
On Truncated-SVD-like Sparse Solutions to Least-Squares Problems of Arbitrary Dimensions00.342012
Faster Subset Selection for Matrices and Applications.170.812012
Improved Low-rank Matrix Decompositions via the Subsampled Randomized Hadamard Transform00.342011
Topics in matrix sampling algorithms60.622011
Sparse Features for PCA-Like Linear Regression.30.422011
Stochastic Dimensionality Reduction for K-means Clustering50.472011
Near Optimal Column-Based Matrix Reconstruction451.962011
Random Projections for $k$-means Clustering371.392010
Unsupervised Feature Selection for the $k$-means Clustering Problem.421.462009
SVD based initialization: A head start for nonnegative matrix factorization1496.362008
Random projections for the nonnegative least-squares problem211.612008
Unsupervised feature selection for principal components analysis482.482008
Clustered subset selection and its applications on it service metrics30.422008