Answers are grounded in this paper and cite their sources.
Over the past few decades, significant progress has been made in clustering high-dimensional data sets distributed around a collection of linear and affine subspaces. This article presented a review of such progress, which included a number of existing subspace clustering algorithms together with an experimental evaluation on the motion segmentation and face clustering problems in computer vision.
No takes yet. Share an insight, caveat, or question.
Renè Vidal (2011) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: