Projective clustering in high dimensions using core-sets

DOI10.1145/513400.513440zbMath1414.68124OpenAlexW1984675750MaRDI QIDQ4557567

Sariel Har-Peled, Kasturi R. Varadarajan

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

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

zbMATH Keywords

computational convexityprojective clustering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (9)

Dynamic coresets ⋮ Core-Sets: Updated Survey ⋮ Efficient subspace approximation algorithms ⋮ Analysis of incomplete data and an intrinsic-dimension Helly theorem ⋮ Optimal core-sets for balls ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ Fast subspace approximation via greedy least-squares ⋮ Unnamed Item ⋮ Streaming algorithms for extent problems in high dimensions

This page was built for publication: Projective clustering in high dimensions using core-sets