Robust sparse nonnegative matrix factorization based on maximum correntropy criterion
Nonnegative matrix factorization (NMF) is a significant matrix decomposition technique for learning parts-based, linear representation of nonnegative data, which has been widely used in a broad range of practical applications such as document clustering, image clustering, face recognition and blind...
Saved in:
Main Authors: | Peng, Siyuan, Ser, Wee, Lin, Zhiping, Chen, Badong |
---|---|
Other Authors: | School of Electrical and Electronic Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/140395 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Robust semi-supervised nonnegative matrix factorization for image clustering
by: Peng, Siyuan, et al.
Published: (2022) -
Robust nonnegative matrix factorization with local coordinate constraint for image clustering
by: Peng, Siyuan, et al.
Published: (2021) -
Correntropy based nonnegative matrix factorization : algorithms and clustering applications
by: Peng, Siyuan
Published: (2020) -
Robust orthogonal nonnegative matrix tri-factorization for data representation
by: Peng, Siyuan, et al.
Published: (2022) -
Correntropy based graph regularized concept factorization for clustering
by: Peng, Siyuan, et al.
Published: (2020)