Dimensionality Reduction for k-Means Clustering and Low Rank Approximation

DOI10.1145/2746539.2746569zbMath1321.68398arXiv1410.6801OpenAlexW2133157266MaRDI QIDQ2941504

Michael B. Cohen, Christopher Musco, Madalina Persu, Cameron Musco, Sam Elder

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.6801

zbMATH Keywords

sketchingclusteringsingular value decompositionfeature extractionprincipal component analysisdimensionality reductionfeature selectionlow rank approximation\(k\)-meansdistributedstreamingJohnson-Lindenstraussprojection cost preserving

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (31)

Side-constrained minimum sum-of-squares clustering: mathematical programming and random projections ⋮ Unnamed Item ⋮ Infinite lattice learner: an ensemble for incremental learning ⋮ Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering ⋮ Unnamed Item ⋮ Structural conditions for projection-cost preservation via randomized matrix multiplication ⋮ An Improved Analysis and Unified Perspective on Deterministic and Randomized Low-Rank Matrix Approximation ⋮ A novel method for optimizing spectral rotation embedding \(K\)-means with coordinate descent ⋮ Practical Sketching Algorithms for Low-Rank Matrix Approximation ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A Doubly Enhanced EM Algorithm for Model-Based Tensor Clustering ⋮ Sketching for Principal Component Regression ⋮ Parameterized \(k\)-clustering: tractability island ⋮ Core-Sets: Updated Survey ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ Toward a unified theory of sparse dimensionality reduction in Euclidean space ⋮ On using Toeplitz and circulant matrices for Johnson-Lindenstrauss transforms ⋮ An efficient \(K\)-means clustering algorithm for tall data ⋮ Unnamed Item ⋮ Pass-Efficient Randomized Algorithms for Low-Rank Matrix Approximation Using Any Number of Views ⋮ Random projections for Bayesian regression ⋮ On coresets for support vector machines ⋮ On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms ⋮ Frequent Directions: Simple and Deterministic Matrix Sketching ⋮ Streaming Low-Rank Matrix Approximation with an Application to Scientific Simulation ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Dimensionality Reduction for k-Means Clustering and Low Rank Approximation