Space complexity of Euclidean clustering
From MaRDI portal
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites work
- (1 + )-approximation for facility location in data streams
- A new coreset framework for clustering
- A new framework for matrix discrepancy: partial coloring bounds via mirror descent
- A unified framework for approximating and clustering data
- Almost Optimal Explicit Johnson-Lindenstrauss Families
- Comparison of the Method of Averages with the Method of Least Squares
- Computing Invariant Subspaces of a General Matrix when the Eigensystem is Poorly Conditioned
- Coresets for clustering in Euclidean spaces: importance sampling is nearly optimal
- Essay on the n dimensional geometry.
- Extensions of Lipschitz maps into Banach spaces
- scientific article; zbMATH DE number 6381735 (Why is no real title available?)
- scientific article; zbMATH DE number 7650129 (Why is no real title available?)
- Least squares quantization in PCM
- Numerical Methods for Computing Angles Between Linear Subspaces
- On coresets for k-means and k-median clustering
- On the largest principal angle between random subspaces
- Optimal (Euclidean) Metric Compression
- Optimal compression of approximate inner products and dimension reduction
- Optimal lower bounds for sketching graph cuts
- Optimal terminal dimensionality reduction in Euclidean space
- Optimality of the Johnson-Lindenstrauss lemma
- Performance of Johnson-Lindenstrauss transform for \(k\)-means and \(k\)-medians clustering
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- Six Standard Deviations Suffice
- Streaming euclidean k-median and k-means with o( n) space
- Streaming Euclidean \textsc{Max-Cut}: dimension vs data reduction
- Strong coresets for k-median and subspace approximation: goodbye dimension
- Terminal embeddings
- Terminal embeddings in sublinear time
- The random matrix theory of the classical compact groups
- Towards optimal lower bounds for k-median and k-means coresets
This page was built for publication: Space complexity of Euclidean clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6895812)
