Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization
To address problems that the effectiveness of feature learned from real noisy data by classical nonnegative matrix factorization method,a novel sparsity induced manifold regularized convex nonnegative matrix factorization algorithm (SGCNMF) was proposed.Based on manifold regularization,the L<...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2020-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020064/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | To address problems that the effectiveness of feature learned from real noisy data by classical nonnegative matrix factorization method,a novel sparsity induced manifold regularized convex nonnegative matrix factorization algorithm (SGCNMF) was proposed.Based on manifold regularization,the L<sub>2,1</sub>norm was introduced to the basis matrix of low dimensional subspace as sparse constraint.The multiplicative update rules were given and the convergence of the algorithm was analyzed.Clustering experiment was designed to verify the effectiveness of learned features within various of noisy environments.The empirical study based on K-means clustering shows that the sparse constraint reduces the representation of noisy features and the new method is better than the 8 similar algorithms with stronger robustness to a variable extent. |
|---|---|
| ISSN: | 1000-436X |