.png){kind=icon}
.png){kind=icon}
Return
THE NONNEGATIVE MATRIX FACTORIZATION: REGULARIZATION AND COMPLEXITY
.png){kind=icon}
PRE
AI
DOI：10.1137/14099841X.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data continues to grow, and it has become ever important to find effective big data analysis techniques. Computational tools, such as singular value decomposition, have been employed in the interpretation of big data. Another tool has recently gained popularity and comparative success: the nonnegative matrix factorization (NMF). The NMF method is a feature selection, dimension reduction algorithm which takes a data matrix and finds a simpler representation. In this paper, we discuss the choice of regularization parameters for a regularized NMF problem, and we develop a primal-dual active set method which enhances the representation. In addition, we examine rank determination for the case of the NMF problem. We develop a method to choose the proper complexity based on the concept of NMF-singular values.
Keywords:
nonnegative matrix factorization
primal-dual active set
regularization
complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.6
Papers:
5.1K
Citations:
1.8W