methods / Dictionary Learning / k-Subspace Clustering
k-Subspace Clustering
Groups an already-trained sparse dictionary's decoder atoms into candidate low-rank subspaces by fitting a mixture of linear subspaces (rather than point clusters) to the atom set, surfacing groups of latents that jointly span a shared direction set.