2022
DOI: 10.1109/access.2022.3199354
|View full text |Cite
|
Sign up to set email alerts
|

Robust Graph Regularized Nonnegative Matrix Factorization

Abstract: Nonnegative Matrix Factorization (NMF) has become a popular technique for dimensionality reduction, and been widely used in machine learning, computer vision, and data mining. Existing unsupervised NMF methods impose the intrinsic geometric constraint on the encoding matrix, which only indirectly affects the base matrix. Moreover, they ignore the global structure of the data space. To address these issues, in this paper we propose a novel unsupervised NMF learning framework, called Robust Graph regularized Non… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2025
2025

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 65 publications
0
1
0
Order By: Relevance
“…To enhance the performance of the original NMF method, much new research approaches have been developed in recent years [18][19][20][21][22]. For example, the graph regularizationbased NMF methods have been proposed [23][24][25], which consider the intrinsic geometry structure information of data (or feature) space, and incorporate the single (or dual) graph regularization for enhancing the performance.…”
Section: Introductionmentioning
confidence: 99%
“…To enhance the performance of the original NMF method, much new research approaches have been developed in recent years [18][19][20][21][22]. For example, the graph regularizationbased NMF methods have been proposed [23][24][25], which consider the intrinsic geometry structure information of data (or feature) space, and incorporate the single (or dual) graph regularization for enhancing the performance.…”
Section: Introductionmentioning
confidence: 99%