Learning Theory

DOI10.1007/B98522zbMATH Open1078.68687OpenAlexW4206057230MaRDI QIDQ4680894FDOQ4680894

Authors: Shai Ben-David 

Publication date: 13 June 2005

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

Full work available at URL: https://doi.org/10.1007/b98522

Recommendations

• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• A \(k\)-median algorithm with running time independent of data size
• Optimal time bounds for approximate clustering
• Automata, Languages and Programming
• Sublinear‐time approximation algorithms for clustering via random sampling

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Cited In (12)

• A \(k\)-median algorithm with running time independent of data size
• Metric \(k\)-median clustering in insertion-only streams
• Consistency of spectral clustering
• Sublinear time approximate clustering
• Automata, Languages and Programming
• Approximation Algorithms for Aversion k-Clustering via Local k-Median
• Optimal time bounds for approximate clustering
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• A fast and recursive algorithm for clustering large datasets with \(k\)-medians
• Automata, Languages and Programming
• A statistical view of clustering performance through the theory of \(U\)-processes
• Also for \(k\)-means: more data does not imply better performance

This page was built for publication: Learning Theory

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