Clustering under approximation stability
From MaRDI portal
Publication:5395707
DOI10.1145/2450142.2450144zbMath1281.68232OpenAlexW2041504706MaRDI QIDQ5395707
Anupam Gupta, Maria-Florina Balcan, Avrim L. Blum
Publication date: 17 February 2014
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2450142.2450144
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Approximation algorithms (68W25)
Related Items (9)
Strategyproof facility location in perturbation stable instances ⋮ Perturbation resilience for the facility location problem ⋮ Approximate Clustering with Same-Cluster Queries ⋮ Semi-Supervised Algorithms for Approximately Optimal and Accurate Clustering ⋮ Good (K-means) clusterings are unique (up to small perturbations) ⋮ A unified framework for clustering constrained data without locality property ⋮ Center-based clustering under perturbation stability ⋮ Stability and Recovery for Independence Systems ⋮ \(k\)-means++ under approximation stability
This page was built for publication: Clustering under approximation stability
