Large-scale non-negative subspace clustering based on Nyström approximation

DOI10.1016/j.ins.2023.118981MaRDI QIDQ6196477

Longxia Huang, Liangjun Wang, Heping Song, HongJie Jia, Qirong Mao, Qize Ren

Publication date: 14 March 2024

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

Nyström approximationsubspace clusteringlarge-scale clusteringnon-negative Lagrangian relaxation

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Numerical computation of eigenvalues and eigenvectors of matrices (65F15) General topics in the theory of data (68P01) Computational aspects of data analysis and big data (68T09) Numerical methods for low-rank matrix approximation; matrix compression (65F55)

Cites Work

• GraphLSHC: towards large scale spectral hypergraph clustering
• Subspace clustering using ensembles of K-subspaces
• Learning the parts of objects by non-negative matrix factorization
• Nonnegative matrix factorization with local similarity learning

This page was built for publication: Large-scale non-negative subspace clustering based on Nyström approximation