A FAST k-MEANS IMPLEMENTATION USING CORESETS
From MaRDI portal
Publication:3604141
DOI10.1142/S0218195908002787zbMATH Open1182.65034MaRDI QIDQ3604141FDOQ3604141
Authors: Gereon Frahling, Christian Sohler 
Publication date: 24 February 2009
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Least squares quantization in PCM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating extent measures of points.
- Clustering motion
- Optimal time bounds for approximate clustering
- On approximate geometric \(k\)-clustering
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Smaller coresets for \(k\)-median and \(k\)-means clustering
- Sublinear‐time approximation algorithms for clustering via random sampling
Cited In (10)
- Coresets for Fuzzy K-Means with Applications
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
- Clustering-based ensembles for one-class classification
- A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
- Experience with a hybrid processor: \(k\)-means clustering
- On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
- On coresets for k-means and k-median clustering
- Compressive statistical learning with random feature moments
- Algorithms and Computation
- Approximating Spectral Clustering via Sampling: A Review
This page was built for publication: A FAST k-MEANS IMPLEMENTATION USING CORESETS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604141)
