.png){kind=icon}
返回
A nonnegative matrix factorization algorithm based on a discrete-time projection neural network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2018.03.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 proposed based on the discrete-time projection neural network and a backtracking step-size adaptation. The proposed algorithm is proven to be able to reduce the objective function value iteratively until attaining a partial optimum of the formulated biconvex optimization problem. Experimental results based on various data sets are presented to substantiate the efficacy of the algorithm. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
Nonnegative matrix factorization
Discrete-time projection neural network
Biconvex optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
7.9K
被引数:
3.0W
机构
引用论文
分享收藏PSI: Patch-based script identification using non-negative matrix factorization.png)
PATTERN RECOGNITION
PATTERN RECOGNITIONIF7.6
PREAI
分享收藏A collective neurodynamic optimization approach to bound-constrained nonconvex optimizationNEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
查看更多内容