A FAST k-MEANS IMPLEMENTATION USING CORESETS

DOI10.1142/S0218195908002787MaRDI QIDQ3604141zbMATHFDO

Authors Gereon Frahling, Christian Sohler

Publication date 24 February 2009

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

computational geometryapproximation algorithmsclustering algorithmsalgorithm engineering

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• On coresets for k-means and k-median clustering
• A PTAS for k-means clustering based on weak coresets
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• A local search approximation algorithm for \(k\)-means clustering

Cites work

• scientific article; zbMATH DE number 41467 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3579840 (Why is no real title available?)
• Approximating extent measures of points.
• Clustering motion
• Faster core-set constructions and data-stream algorithms in fixed dimensions
• Least squares quantization in PCM
• On approximate geometric \(k\)-clustering
• Optimal time bounds for approximate clustering
• Smaller coresets for \(k\)-median and \(k\)-means clustering
• Sublinear‐time approximation algorithms for clustering via random sampling

Cited in

(12)

• A strong coreset algorithm to accelerate OPF as a graph-based machine learning in large-scale problems
• Coresets for Fuzzy K-Means with Applications
• Clustering-based ensembles for one-class classification
• Experimental evaluation of fully dynamic \(k\)-means via coresets
• Coresets for kernel clustering
• Compressive statistical learning with random feature moments
• On Coresets for k-Median and k-Means Clustering in Metric and Euclidean Spaces and Their Applications
• Experience with a hybrid processor: \(k\)-means clustering
• Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering
• Algorithms and Computation
• Approximating spectral clustering via sampling: a review
• On coresets for k-means and k-median clustering

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)