arrow
返回

Accelerated sparse nonnegative matrix factorization for unsupervised feature learning

delete2022-04-01
delete3
PRE
AI
T
Ting Xie *
H
Hua Zhang
R
Ruihua Liu
肖汉光 (Hanguang Xiao)
DOI:10.1016/j.patrec.2022.01.020delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Sparse Nonnegative Matrix Factorization (SNMF) is a fundamental unsupervised representation learning technique, and it represents low-dimensional features of a data set and lends itself to a clustering interpretation. However, the model and algorithm of SNMF have some shortcomings. In this work, we created a clustering method by improving the SNMF model and its Alternating Direction Multiplier Method acceleration algorithm. A novel, fast and closed-form iterative solution is proposed for SNMF with implicit sparse constraints which are L- 1 and L-2 norms of the coefficient and basis matrixes, respectively. A low-dimensional feature space is also proposed as result of the closed-form iteration formats of each sub-problem obtained by variable splitting. In addition, the convergence points of the presented iterative algorithms are stationary points of the model. Finally, numerical experiments show that the improved algorithm is comparable to the sate-of-the-art methods in data clustering. (C) 2022 Elsevier B.V. All rights reserved.
Keyword:
Nonnegative matrix factorization
Clustering
Sparse

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
7.9K
被引数:
1.6W

机构

U
University of Texas Dallas
学者数:
5.6K
论文数: 5.0K
被引数: 15
C
Chongqing University of Technology
学者数:
5.8K
论文数: 3.5K
被引数: 3
引用论文

引用论文

err分享
err收藏
err分享
err收藏
Towards energy-autonomous wake-up receiver using Visible Light Communication
err2016-01-01
err0
errOAAI
errJoyce Sariol Ramos; Ilker Demirkol; Josep Paradells; Daniel Vossing; Karim M. Gad; Martin Kasemann
err分享
err收藏
Non-negative matrix factorization with α-divergence具有 α-散度的非负矩阵分解
err2008-07-01
err113
errOAAI
errCichocki, Andrzej; Lee, Hyekyoung; Kim, Yong-Deok; Choi, Seungjin
err分享
err收藏
学者 查看更多内容