A k-median algorithm with running time independent of data size

DOI10.1023/B:MACH.0000033115.78247.F0MaRDI QIDQ703077zbMATH OpenOpenAlexFDO

Authors Adam Meyerson, Liadan O'Callaghan, Serge Plotkin

Publication date 19 January 2005

Published in Machine Learning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/b:mach.0000033115.78247.f0

zbMATH Keywords

samplingClusteringsublinear

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Recommendations

• Optimal time bounds for approximate clustering
• Learning Theory
• Automata, Languages and Programming
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• On coresets for k-means and k-median clustering

Cited in

(17)

• Sublinear-time Algorithms
• Small space representations for metric min-sum \(k\)-clustering and their applications
• scientific article; zbMATH DE number 7651177 (Why is no real title available?)
• Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
• scientific article; zbMATH DE number 2090269 (Why is no real title available?)
• Mathematical programming formulations and algorithms for discrete \(k\)-median clustering of time-series data
• Robust communication-optimal distributed clustering algorithms
• Automata, Languages and Programming
• Learning Theory
• Near-optimal clustering in the \(k\)-machine model
• An experimental evaluation of incremental and hierarchical \(k\)-median algorithms
• Optimal time bounds for approximate clustering
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• Data reduction for weighted and outlier-resistant clustering
• A new efficient algorithm based on DC programming and DCA for clustering
• Clustering with or without the approximation
• Clustering with or without the approximation

This page was built for publication: A \(k\)-median algorithm with running time independent of data size

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