Clustering lines in high-dimensional space, classification of incomplete data

DOI10.1145/1868237.1868246MaRDI QIDQ3188990zbMATH OpenOpenAlexFDO

Authors

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

clusteringHelly theoremhigh dimensionlines

Mathematics Subject Classification ID

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

Recommendations

• Analysis of incomplete data and an intrinsic-dimension Helly theorem
• Analysis of incomplete data and an intrinsic-dimension Helly theorem
• Clustering affine subspaces: hardness and algorithms
• Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces
• Linear-time approximation schemes for clustering problems in any dimensions

Cited in

(12)

• Contraction and expansion of convex sets
• The complexity of binary matrix completion under diameter constraints
• Helly’s theorem: New variations and applications
• The use of linked line segments for cluster representation and data reduction
• Clustering affine subspaces: hardness and algorithms
• Analysis of incomplete data and an intrinsic-dimension Helly theorem
• Linear-time approximation scheme for k-means clustering of axis-parallel affine subspaces
• Improved separated red-blue center clustering
• Coresets for k-median of lines with group fairness constraints
• Matrix completion: approximating the minimum diameter
• Efficient coreset construction algorithm for fair k-median of lines
• Clustering point sets revisited

This page was built for publication: Clustering lines in high-dimensional space, classification of incomplete data

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