Clustering lines in high-dimensional space

DOI10.1145/1868237.1868246zbMath1295.68199OpenAlexW2052979560MaRDI QIDQ3188990

No author found.

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

clusteringlineshigh dimensionHelly theorem

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (6)

The complexity of binary matrix completion under diameter constraints ⋮ Linear-time approximation scheme for \(k\)-means clustering of axis-parallel affine subspaces ⋮ Improved separated red-blue center clustering ⋮ Helly’s theorem: New variations and applications ⋮ Analysis of incomplete data and an intrinsic-dimension Helly theorem ⋮ Contraction and expansion of convex sets

This page was built for publication: Clustering lines in high-dimensional space