Greedy Feature Selection for Subspace Clustering
From MaRDI portal
Publication:2933905
zbMath1317.68154arXiv1303.4778MaRDI QIDQ2933905
Aswin C. Sankaranarayanan, Richard G. Baraniuk, Eva L. Dyer
Publication date: 8 December 2014
Full work available at URL: https://arxiv.org/abs/1303.4778
sparse approximationlow-rank approximationnearest neighborsstructured sparsitysubspace clusteringhybrid linear modelsunions of subspaces
Directional data; spatial statistics (62H11) Ridge regression; shrinkage estimators (Lasso) (62J07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (5)
Subspace learning by \(\ell^0\)-induced sparsity ⋮ Unnamed Item ⋮ Greedy orthogonal matching pursuit for subspace clustering to improve graph connectivity ⋮ Dimensionality-reduced subspace clustering ⋮ Kernel penalized K-means: a feature selection method based on kernel K-means
This page was built for publication: Greedy Feature Selection for Subspace Clustering