A k-median algorithm with running time independent of data size
From MaRDI portal
Publication:703077
DOI10.1023/B:MACH.0000033115.78247.F0zbMATH Open1093.68635OpenAlexW2004931706MaRDI QIDQ703077FDOQ703077
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
Recommendations
Cited In (17)
- Sublinear-time Algorithms
- Small space representations for metric min-sum \(k\)-clustering and their applications
- Title not available (Why is that?)
- Attainable accuracy guarantee for the \(k\)-medians clustering in [0, 1]
- Title not available (Why is that?)
- 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
- An experimental evaluation of incremental and hierarchical \(k\)-median algorithms
- Near-optimal clustering in the \(k\)-machine model
- 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)
