Randomized Dimensionality Reduction for <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Means Clustering

DOI10.1109/TIT.2014.2375327zbMath1359.62232arXiv1110.2897OpenAlexW2962963658MaRDI QIDQ2978788

Anastasios Zouzias, Christos Boutsidis, Michael W. Mahoney, Petros Drineas

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Information theory (general) (94A15)

Related Items

A novel feature selection approach based on clustering algorithm, Optimal column subset selection for image classification by genetic algorithms, Unnamed Item, Performance of Johnson--Lindenstrauss Transform for $k$-Means and $k$-Medians Clustering, Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection, Structural conditions for projection-cost preservation via randomized matrix multiplication, Minimum cost‐compression risk in principal component analysis, k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts, On coresets for fair clustering in metric and Euclidean spaces and their applications, Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers, Parameterized \(k\)-clustering: tractability island, Real-Time Radiation Treatment Planning with Optimality Guarantees via Cluster and Bound Methods, 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, Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics, Dimension reduction for objects composed of vector sets, Fuzzy \(c\)-means and cluster ensemble with random projection for big data clustering, On Using Toeplitz and Circulant Matrices for Johnson-Lindenstrauss Transforms, Quick-means: accelerating inference for K-means by learning fast transforms, Unnamed Item, Subset selection for matrices with fixed blocks, Unnamed Item