Agnostic clustering

DOI10.1007/978-3-642-04414-4_31MaRDI QIDQ3648765zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Clustering with or without the approximation
• Sublinear time approximate clustering
• Clustering with or without the approximation
• Correlation clustering
• Testing of Clustering

Cites work

• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
• A local search approximation algorithm for \(k\)-means clustering
• A new greedy approach for facility location problems
• A theory of the learnable
• scientific article; zbMATH DE number 5485581 (Why is no real title available?)
• Toward efficient agnostic learning

Cited in

(1)

• Clustering with or without the approximation

This page was built for publication: Agnostic clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3648765)