.png){kind=icon}
.png){kind=icon}
Return
Adaptive Graph Regularization Discriminant Nonnegative Matrix Factorization for Data Representation
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2019.2933877.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonnegative matrix factorization, as a classical part-based representation method, has been widely used in pattern recognition, data mining and other fields. However, the traditional nonnegative matrix factorization directly factoring decomposes the original data, and the original data often contains a lot of redundancy and noise, which seriously affect the subsequent processing of the data. In this work, we propose an adaptive graph regularization discriminant nonnegative matrix factorization (AGDNMF) for image clustering. The AGDNMF algorithm makes full use of local structure information and a small amount of label information. In AGDNMF, the local structure information can be more accurate and the label information can prevent the points with the same label from being merged into one point. These two items are combined into the objective function of NMF. In addition, we provide the update rules for the corresponding optimization functions and prove its convergence. A large number of experiments on different data sets show that the proposed algorithm has good clustering performance.
Keywords:
Nonnegative matrix factorization
graph regularization
discriminative information
image clustering
data representation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
No organization information available