Data stability in clustering: a closer look
From MaRDI portal
Publication:465252
DOI10.1016/j.tcs.2014.09.025zbMath1360.62314arXiv1107.2379OpenAlexW2174175400MaRDI QIDQ465252
Publication date: 31 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.2379
Related Items (2)
On semi-supervised active clustering of stable instances with oracles ⋮ Finding Meaningful Cluster Structure Amidst Background Noise
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Center-based clustering under perturbation stability
- A constant-factor approximation algorithm for the \(k\)-median problem
- On the Complexity of the Metric TSP under Stability Considerations
- Partition into Triangles on Bounded Degree Graphs
- On Nash-Equilibria of Approximation-Stable Games
- Linear-time approximation schemes for clustering problems in any dimensions
- Clustering with or without the Approximation
- A new greedy approach for facility location problems
- Approximation schemes for clustering problems
- Greedy Strikes Back: Improved Facility Location Algorithms
- Local Search Heuristics for k-Median and Facility Location Problems
- Least squares quantization in PCM
- Approximating min-sum k -clustering in metric spaces
- A Sober Look at Clustering Stability
- Clustering under Perturbation Resilience
- Theory and Applications of Models of Computation
This page was built for publication: Data stability in clustering: a closer look
