.png){kind=icon}
.png){kind=icon}
Return
Robust Structured Convex Nonnegative Matrix Factorization for Data Representation
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2021.3128975.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Nonnegative Matrix Factorization (NMF) is a popular technique for machine learning. Its power is that it can decompose a nonnegative matrix into two nonnegative factors whose product well approximates the nonnegative matrix. However, the nonnegative constraint of the data matrix limits its application. Additionally, the representations learned by NMF fail to respect the intrinsic geometric structure of the data. In this paper, we propose a novel unsupervised matrix factorization method, called Robust Structured Convex Nonnegative Matrix Factorization (RSCNMF). RSCNMF not only achieves meaningful factorizations of the mixed-sign data, but also learns a discriminative representation by leveraging local and global structures of the data. Moreover, it introduces the L-2,L-1-norm loss function to deal with noise and outliers, and exploits the L-2,L-1-norm feature regularizer to select discriminative features across all the samples. We develop an alternate iterative scheme to solve such a new model. The convergence of RSCNMF is proven theoretically and verified empirically. The experimental results on eight real-world data sets show that our RSCNMF algorithm matches or outperforms the state-of-the-art methods.
Keywords:
Convex nonnegative matrix factorization
global structure
L-2,L-1 norm
clustering
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W