Recommendations
Cites work
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Learning spectral clustering, with application to speech separation
- Learning the parts of objects by non-negative matrix factorization
- Multiway spectral clustering: a margin-based perspective
- Non-negative matrix factorization with sparseness constraints
- Projected Gradient Methods for Nonnegative Matrix Factorization
Cited in
(12)- Data Analytics on Graphs Part I: Graphs and Spectra on Graphs
- Kernel-based \(L_{2,1}\) norm non-negative matrix factorization in image clustering
- Low-rank doubly stochastic matrix decomposition for cluster analysis
- Global discriminative-based nonnegative spectral clustering
- Similarity-based clustering by left-stochastic matrix factorization
- Sparse spectral clustering method based on the incomplete Cholesky decomposition
- scientific article; zbMATH DE number 6907452 (Why is no real title available?)
- Learning spectral clustering, with application to speech separation
- Enhanced balanced min cut
- Spectral nonlinearly embedded clustering algorithm
- Application of sparse spectral clustering algorithm in high-dimensional data
- Non-redundant multiple clustering by nonnegative matrix factorization
This page was built for publication: Non-negative and sparse spectral clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898301)