.png){kind=icon}
Return
Two Efficient Algorithms for Approximately Orthogonal Nonnegative Matrix Factorization
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2014.2371895.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonnegativematrix factorization (NMF) with orthogonality constraints is quite important due to its close relation with the K-means clustering. While existing algorithms for orthogonal NMF impose strict orthogonality constraints, in this letter we propose a penalty method with the aim of performing approximately orthogonal NMF, together with two efficient algorithms respectively based on the Hierarchical Alternating Least Squares (HALS) and the Accelerated Proximate Gradient (APG) approaches. Experimental evidence was provided to show their high efficiency and flexibility by using synthetic and real-world data.
Keywords:
Accelerated proximal gradient
nonnegative matrix factorization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
ShareSaveTwo algorithms for orthogonal nonnegative matrix factorization with application to clustering.png)
NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAIShareSaveShareSaveShareSave
View more