Agnostic Clustering

DOI10.1007/978-3-642-04414-4_31zbMath1262.68147OpenAlexW4210939371MaRDI QIDQ3648765

Maria-Florina Balcan, Heiko Röglin, Shang-Hua Teng

Publication date: 1 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04414-4_31

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Clustering with or without the approximation

Cites Work

• Unnamed Item
• A local search approximation algorithm for \(k\)-means clustering
• Toward efficient agnostic learning
• A constant-factor approximation algorithm for the k -median problem (extended abstract)
• A new greedy approach for facility location problems
• A theory of the learnable

This page was built for publication: Agnostic Clustering