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!
|
| _version_ | 1841539397753765888 |
|---|---|
| author | Feiyue QIU Bowen CHEN Tieming CHEN Guodao ZHANG |
| author_facet | Feiyue QIU Bowen CHEN Tieming CHEN Guodao ZHANG |
| author_sort | Feiyue QIU |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-ff2f56c7612c4f5ebb3fea2e651de73f |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2020-05-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-ff2f56c7612c4f5ebb3fea2e651de73f2025-01-14T07:19:17ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2020-05-0141849559735394Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularizationFeiyue QIUBowen CHENTieming CHENGuodao ZHANGTo 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.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020064/nonnegative matrix factorizationmanifold regularizationsparse constraintK-means clustering |
| spellingShingle | Feiyue QIU Bowen CHEN Tieming CHEN Guodao ZHANG Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization Tongxin xuebao nonnegative matrix factorization manifold regularization sparse constraint K-means clustering |
| title | Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization |
| title_full | Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization |
| title_fullStr | Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization |
| title_full_unstemmed | Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization |
| title_short | Sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization |
| title_sort | sparsity induced convex nonnegative matrix factorization algorithm with manifold regularization |
| topic | nonnegative matrix factorization manifold regularization sparse constraint K-means clustering |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020064/ |
| work_keys_str_mv | AT feiyueqiu sparsityinducedconvexnonnegativematrixfactorizationalgorithmwithmanifoldregularization AT bowenchen sparsityinducedconvexnonnegativematrixfactorizationalgorithmwithmanifoldregularization AT tiemingchen sparsityinducedconvexnonnegativematrixfactorizationalgorithmwithmanifoldregularization AT guodaozhang sparsityinducedconvexnonnegativematrixfactorizationalgorithmwithmanifoldregularization |