A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
This paper presents an algorithm for nonnegative matrix factorization based on a biconvex optimization formulation. First, a discrete-time projection neural network is introduced. An upper bound of its step size is derived to guarantee the stability of the neural network. Then, an algorithm is propo...
Saved in:
Published in | Neural networks Vol. 103; pp. 63 - 71 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
United States
Elsevier Ltd
01.07.2018
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!