Subquadratic approximation algorithms for clustering problems in high dimensional spaces

DOI10.1145/301250.301367MaRDI QIDQ5890867zbMATH OpenOpenAlexFDO

Authors Allan Borodin, Rafail Ostrovsky, Yuval Rabani

Publication date 29 September 2016

Published in Proceedings of the thirty-first annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301250.301367

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Approximation algorithms (68W25)

Recommendations

• Subquadratic approximation algorithms for clustering problems in high dimensional spaces
• Linear-time approximation schemes for clustering problems in any dimensions
• scientific article; zbMATH DE number 1947041
• Clustering for edge-cost minimization (extended abstract)
• scientific article; zbMATH DE number 1947400

Cited in

(8)

• Performance guarantees for hierarchical clustering
• On computing the diameter of a point set in high dimensional Euclidean space.
• Linear manifold clustering in high dimensional spaces by stochastic search
• A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
• Sublinear‐time approximation algorithms for clustering via random sampling
• scientific article; zbMATH DE number 1947400 (Why is no real title available?)
• Towards a theory of intrusion detection
• Subquadratic approximation algorithms for clustering problems in high dimensional spaces

This page was built for publication: Subquadratic approximation algorithms for clustering problems in high dimensional spaces

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