.png){kind=icon}
.png){kind=icon}
Return
A multi-view clustering algorithm based on deep semi-NMF
.png){kind=icon}
PRE
AI
DOI：10.1016/j.inffus.2023.101884.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Multi-view clustering (MVC) aims to fuse the information among multiple views to achieve effective clustering. Many MVC algorithms based on semi-nonnegative matrix factorization (SNMF) typically have two issues: (1) their optimization schemes are not flexible enough; and (2) the variables are updated only rely on the data but not guided by learning rate. These problems can result in very poor clusters generated. In this paper, we present a multi-view clustering algorithm based on deep SNMF (MCDS) to resolve these issues. Specifically, we first design two types of activation functions to restrict the value domain of the element in the low-dimensional matrix to eliminate the constraint. Then, the SGD algorithm is used to implement element update guided by the learning rate. After obtaining the corresponding weight matrix and bias matrix, we combine them with the activation functions to construct a deep SNMF (DSNMF) network. This network is to update the element in the corresponding low-dimensional matrix for each view and obtain the consensus matrix. To validate the proposed algorithm, numerous experiments are performed on six multi-view datasets including both normal and large-scale datasets. The results demonstrate that MCDS can achieve excellent clustering results and outperform other competitive methods.
Keywords:
Multi-view fusion
Semi-nonnegative matrix factorization
Multi-view clustering
Deep learning
Journal
IF:
15.5
Papers:
4.1K
Citations:
2.7W