arrow
Return

A Generalized Deep Learning Clustering Algorithm Based on Non-Negative Matrix Factorization

delete2023-05-04
delete28
PRE
AI
王德贤 cover
王德贤 (Dexian Wang)
T
Tianrui Li *
P
Ping Deng
F
Fan Zhang
黄维 cover
黄维 (Wei Huang)
张鹏飞 cover
张鹏飞 (Pengfei Zhang)
J
Jia Liu
DOI:10.1145/3584862delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Clustering is a popular research topic in the field of data mining, in which the clustering method based on non-negative matrix factorization (NMF) has been widely employed. However, in the update process of NMF, there is no learning rate to guide the update as well as the update depends on the data itself, which leads to slow convergence and low clustering accuracy. To solve these problems, a generalized deep learning clustering (GDLC) algorithm based on NMF is proposed in this article. Firstly, a nonlinear constrained NMF (NNMF) algorithm is constructed to achieve sequential updates of the elements in the matrix guided by the learning rate. Then, the gradient values corresponding to the element update are transformed into generalized weights and generalized biases, by inputting the elements as well as their corresponding generalized weights and generalized biases into the nonlinear activation function to construct the GDLC algorithm. In addition, for improving the understanding of the GDLC algorithm, its detailed inference procedure and algorithm design are provided. Finally, the experimental results on eight datasets show that the GDLC algorithm has efficient performance.
Keywords:
Deep learning
clustering
non-negative matrix factorization

Journal

ACM Transactions on Knowledge Discovery from Data cover
ACM Transactions on Knowledge Discovery from Data
IF:
4.8
Papers:
1.3K
Citations:
4.4K

Organization

S
Southwest Jiaotong University
Scholars:
2.9W
Papers: 2.1W
Citations: 2.3W
X
Xihua University
Scholars:
6.2K
Papers: 3.6K
Citations: 4.1K