Sublinear-time approximation for clustering via random sampling

DOI10.1007/978-3-540-27836-8_35MaRDI QIDQ5466479zbMATH OpenOpenAlexFDO

Authors Christian Sohler, Artur Czumaj

Publication date 24 August 2005

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

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Sublinear‐time approximation algorithms for clustering via random sampling
• Optimal time bounds for approximate clustering
• Sublinear time approximate clustering
• Linear-time approximation schemes for clustering problems in any dimensions
• A framework for statistical clustering with a constant time approximation algorithms for K-median clustering

Cited in

(11)

• On parameterized approximation algorithms for balanced clustering
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• Sublinear time approximate clustering
• Sublinear‐time approximation algorithms for clustering via random sampling
• Selective sampling for approximate clustering of very large data sets
• scientific article; zbMATH DE number 7651177 (Why is no real title available?)
• Maximizing the number of rides served for time-limited Dial-a-Ride*
• Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions
• Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions
• Optimal time bounds for approximate clustering
• Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

This page was built for publication: Sublinear-time approximation for clustering via random sampling

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