Sublinear time approximate clustering

zbMATH Open0987.68068MaRDI QIDQ2768331FDOQ2768331

Authors: Nina Mishra, Dan Oblinger, Leonard Pitt 

Publication date: 30 January 2002

Recommendations

• Automata, Languages and Programming
• Sublinear‐time approximation algorithms for clustering via random sampling
• Optimal time bounds for approximate clustering
• Testing of Clustering
• Learning Theory

zbMATH Keywords

PAC-clustering algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (14)

• Sublinear‐time approximation algorithms for clustering via random sampling
• \(k\)-means genetic algorithms with greedy genetic operators
• Sublinear-time Algorithms
• Small space representations for metric min-sum \(k\)-clustering and their applications
• Title not available (Why is that?)
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
• Linear-time approximation schemes for clustering problems in any dimensions
• Agnostic clustering
• A sublinear-time approximation scheme for bin packing
• Testing of Clustering
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• Automata, Languages and Programming
• A new conceptual clustering framework
• Quantum speed-up for unsupervised learning

This page was built for publication: Sublinear time approximate clustering

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