Correntropy based nonnegative matrix factorization : algorithms and clustering applications
In this thesis, to improve existing correntropy based nonnegative matrix factorization (NMF) algorithms and develop new methods for enlarging the range and enhancing the performance in clustering tasks, three novel correntropy based NMF algorithms are proposed, which are respectively the correntrop...
Saved in:
Main Author: | Peng, Siyuan |
---|---|
Other Authors: | Lin Zhiping |
Format: | Thesis-Doctor of Philosophy |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/145283 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
Robust sparse nonnegative matrix factorization based on maximum correntropy criterion
by: Peng, Siyuan, et al.
Published: (2020) -
Correntropy based graph regularized concept factorization for clustering
by: Peng, Siyuan, et al.
Published: (2020) -
Robust semi-supervised nonnegative matrix factorization for image clustering
by: Peng, Siyuan, et al.
Published: (2022) -
Hypergraph based semi-supervised symmetric nonnegative matrix factorization for image clustering
by: Yin, Jingxing, et al.
Published: (2023) -
Robust orthogonal nonnegative matrix tri-factorization for data representation
by: Peng, Siyuan, et al.
Published: (2022)