.png){kind=icon}
Return
Graph Regularized Lp Smooth Non-negative Matrix Factorization for Data Representation
.png){kind=icon}
PRE
AI
DOI：10.1109/JAS.2019.1911417.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper proposes a Graph regularized Lp smooth non-negative matrix factorization (GSNMF) method by incorporating graph regularization and Lp smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second, the Lp smoothing constraint is incorporated into NMF to combine the merits of isotropic (L-2-norm) and anisotropic (L-1-norm) diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.
Keywords:
Data clustering
dimensionality reduction
graph regularization
L(p )smooth non-negative matrix factorization (SNMF)
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
I
IF:
19.2
Papers:
1.4K
Citations:
1.1W
Organization
View more organizations
Cited Papers
No cited papers available