Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means

Farhad Pourkamali-Anaraki, Stephen Becker
10/31/2015
stat.MLcs.LG

Official code: stephenbeckr/SparsifiedKMeans (62 stars, MIT, last commit 2020-04-13).

Abstract

We analyze a compression scheme for large data sets that randomly keeps a small percentage of the components of each data sample. The benefit is that the output is a sparse matrix and therefore subsequent processing, such as PCA or K-means, is significantly faster, especially in a distributed-data setting. Furthermore, the sampling is single-pass and applicable to streaming data. The sampling mechanism is a variant of previous methods proposed in the literature combined with a randomized preconditioning to smooth the data. We provide guarantees for PCA in terms of the covariance matrix, and guarantees for K-means in terms of the error in the center estimators at a given step. We present numerical evidence to show both that our bounds are nearly tight and that our algorithms provide a real benefit when applied to standard test data sets, as well as providing certain benefits over related sampling approaches.

View on arXivView PDF

Code Implementations(1)

MIT

KMeans for big data using preconditioning and sparsification, Matlab implementation. Aka k-means

6246C, MATLABAug 4, 20156 years agoMIT
k-meanskmeansout-of-core

Similar Papers

Cite this paper

@article{pourkamalianaraki2015preconditioned,
  title  = {Preconditioned Data Sparsification for Big Data with Applications to PCA and K-means},
  author = {Farhad Pourkamali-Anaraki and Stephen Becker},
  year   = {2015},
  eprint = {1511.00152},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1511.00152}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1511.00152.svg)](https://codeofpaper.com/paper/1511.00152)

Discussion