Approximate clustering via core-sets
From MaRDI portal
Publication:3579227
DOI10.1145/509907.509947zbMath1192.68871MaRDI QIDQ3579227
Sariel Har-Peled, Piotr Indyk, Mihai Bădoiu
Publication date: 5 August 2010
Published in: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/509907.509947
Related Items
THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS, Approximate minimum enclosing balls in high dimensions using core-sets, New Algorithms for k-Center and Extensions, Analysis of incomplete data and an intrinsic-dimension Helly theorem, Some results on approximate 1-median selection in metric spaces, Minimal containment under homothetics: a simple cutting plane approach, Efficient subspace approximation algorithms, Efficient approximation algorithms for clustering point-sets, Minimum-volume enclosing ellipsoids and core sets, Dynamic coresets, New algorithms for \(k\)-center and extensions, Small space representations for metric min-sum \(k\)-clustering and their applications, Practical methods for shape fitting and kinetic data structures using coresets, On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids, FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation, Optimal core-sets for balls, Frequency-based views to pattern collections, Faster core-set constructions and data-stream algorithms in fixed dimensions, Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere, Topographic Mapping of Large Dissimilarity Data Sets, Sublinear‐time approximation algorithms for clustering via random sampling
