Linear time algorithms for clustering problems in any dimensions

DOI10.1007/11523468_111MaRDI QIDQ5716761zbMATH OpenOpenAlexFDO

Authors Amit Kumar, Yogish Sabharwal, Sandeep Sen

Publication date 10 January 2006

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

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

Mathematics Subject Classification ID

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

Recommendations

• Linear-time approximation schemes for clustering problems in any dimensions
• A \(k\)-median algorithm with running time independent of data size
• Algorithms and Computation
• A linear time algorithm for approximate 2-means clustering
• A framework for statistical clustering with a constant time approximation algorithms for K-median clustering

Cited in

(21)

• Optimal algorithms for complete linkage clustering in d dimensions
• Linear manifold clustering in high dimensional spaces by stochastic search
• A framework for statistical clustering with constant time approximation algorithms for \(K\)-median and \(K\)-means clustering
• A linear time algorithm for approximate 2-means clustering
• Mathematical programming formulations and algorithms for discrete k-median clustering of time-series data
• Polynomial-time approximation schemes for geometric min-sum median clustering
• Sublinear‐time approximation algorithms for clustering via random sampling
• Linear-time approximation schemes for clustering problems in any dimensions
• Bi-criteria linear-time approximations for generalized k-mean/median/center
• A framework for statistical clustering with a constant time approximation algorithms for K-median clustering
• Sublinear-time Algorithms
• The Priority k-Median Problem
• Net and prune: a linear time algorithm for Euclidean distance problems
• scientific article; zbMATH DE number 7053357 (Why is no real title available?)
• Approximating global optimum for probabilistic truth discovery
• Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces
• Hybrid k-clustering: blending k-median and k-center
• Hybrid k-clustering: blending k-median and k-center
• A \(k\)-median algorithm with running time independent of data size
• Dimension-free parameterized approximation schemes for hybrid clustering
• Small space representations for metric min-sum k-clustering and their applications

This page was built for publication: Linear time algorithms for clustering problems in any dimensions

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