Non-negative and sparse spectral clustering

DOI10.1016/J.PATCOG.2013.07.003zbMath1326.68231OpenAlexW1989773214MaRDI QIDQ898301

Hongtao Lu, Zhenyong Fu, Xin Shu

Publication date: 8 December 2015

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2013.07.003

zbMATH Keywords

spectral clusteringsparsenessnon-negative matrix factorizationnormalized cutratio cut

Mathematics Subject Classification ID

Applications of graph theory (05C90) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (2)

Data Analytics on Graphs Part I: Graphs and Spectra on Graphs ⋮ Global discriminative-based nonnegative spectral clustering

Uses Software

• UCI-ml
• Graclus

Cites Work

• Multiway spectral clustering: a margin-based perspective
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Non-negative and sparse spectral clustering