.png){kind=icon}
.png){kind=icon}
Return
Projection concept factorization with self-representation for data clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2022.10.052.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In recent years, matrix factorization-based techniques have received much attention in the data analysis field since it can perform dimensionality reduction and clustering simultaneously. Despite the great suc-cess achieved by the Non-negative matrix factorization (NMF) and concept factorization (CF) methods, they suffer from the out-of-sample problem and are sensitive to the noise. Some recent studies have indi-cated that the similarity relationship is capable of revealing the local structure. In this paper, a similarity graph is constructed to reflect the geometric information of manifold structure, while the concept factor-ization is employed to capture the global structure. In addition, the projection matrix is incorporated into the concept factorization model to eliminate the noise and avoid the out-of-sample problem. An iterative algorithm is introduced to solve the model. The experimental results obtained on both human face and text data sets verify the high efficiency of the proposed method.(c) 2022 Elsevier B.V. All rights reserved.
Keywords:
Concept factorization
Data clustering
Self-representative
Projection matrix
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W