A unified framework for approximating and clustering data
From MaRDI portal
Publication:5419127
DOI10.1145/1993636.1993712zbMath1288.90046OpenAlexW1981773323MaRDI QIDQ5419127
Publication date: 5 June 2014
Published in: Proceedings of the forty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1993636.1993712
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Pattern recognition, speech recognition (68T10) Approximation algorithms (68W25)
Related Items (48)
Sensitivity-Informed Provable Pruning of Neural Networks ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Unnamed Item ⋮ Compressive statistical learning with random feature moments ⋮ On the \(k\)-means/median cost function ⋮ Approximating ( k,ℓ )-Median Clustering for Polygonal Curves ⋮ Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance ⋮ Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces ⋮ On coresets for fair clustering in metric and Euclidean spaces and their applications ⋮ An efficient sum query algorithm for distance-based locally dominating functions ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Network Essence: PageRank Completion and Centrality-Conforming Markov Chains ⋮ Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams ⋮ Learning pharmacokinetic models for in vivo glucocorticoid activation ⋮ Parameterized \(k\)-clustering: tractability island ⋮ Sampling-based dimension reduction for subspace approximation with outliers ⋮ Core-Sets: Updated Survey ⋮ Approximating Spectral Clustering via Sampling: A Review ⋮ Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics ⋮ Coresets for the Nearest-Neighbor Rule ⋮ A simple \(D^2\)-sampling based PTAS for \(k\)-means and other clustering problems ⋮ Metric \(k\)-median clustering in insertion-only streams ⋮ Improved Algorithms for Time Decay Streams ⋮ Noisy, Greedy and Not so Greedy k-Means++ ⋮ Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering ⋮ On Geometric Prototype and Applications ⋮ Improved and simplified inapproximability for \(k\)-means ⋮ Faster balanced clusterings in high dimension ⋮ Unnamed Item ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Approximating global optimum for probabilistic truth discovery ⋮ On coresets for support vector machines ⋮ Fast subspace approximation via greedy least-squares ⋮ A unified framework for clustering constrained data without locality property ⋮ Unnamed Item ⋮ Coresets for Fuzzy K-Means with Applications ⋮ A faster algorithm for truth discovery via range cover ⋮ Approximate Range Queries for Clustering ⋮ Unnamed Item ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: A unified framework for approximating and clustering data
