Matrix approximation and projective clustering via volume sampling

DOI10.1145/1109557.1109681zbMath1192.68889OpenAlexW4243341520MaRDI QIDQ3581518

Amit Deshpande, Grant Wang, Luis Rademacher, Santosh Vempala

Publication date: 16 August 2010

Published in: Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1109557.1109681

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items

Unnamed Item, A randomized algorithm for a tensor-based generalization of the singular value decomposition, Far-field compression for fast kernel summation methods in high dimensions, How to get close to the median shape, Proportional Volume Sampling and Approximation Algorithms for A-Optimal Design, Unnamed Item, Optimal CUR Matrix Decompositions, Core-Sets: Updated Survey, Approximating Spectral Clustering via Sampling: A Review, Efficient subspace approximation algorithms, A Randomized Coordinate Descent Method with Volume Sampling, Improved Algorithms for Time Decay Streams, Matrix recipes for hard thresholding methods, Unnamed Item, Fast randomized matrix and tensor interpolative decomposition using countsketch, On selecting a maximum volume sub-matrix of a matrix and related problems, Fast Randomized Algorithms for t-Product Based Tensor Operations and Decompositions with Applications to Imaging Data, Asymptotic equivalence of fixed-size and varying-size determinantal point processes, Diversity Sampling is an Implicit Regularization for Kernel Methods, Unnamed Item, Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition