.png){kind=icon}
返回
NONNEGATIVE TENSOR DECOMPOSITION VIA COLLABORATIVE NEURODYNAMIC OPTIMIZATION
.png){kind=icon}
PRE
AI
DOI：10.1137/23M1627304.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a novel collaborative neuro dynamic model for computing nonnegative canonical polyadic decomposition (CPD). The model relies on a system of recurrent neural networks to solve the underlying nonconvex optimization problem associated with nonnegative CPD. Additionally, a discrete-time version of the continuous neural network is developed. To enhance the chances of reaching a potential global minimum, the recurrent neural networks are allowed to communicate and exchange information through particle swarm optimization (PSO). Convergence and stability analyses of both the continuous and discrete neuro dynamic models are thoroughly examined. Experimental evaluations are conducted on random and real-world datasets to demonstrate the effectiveness of the proposed approach.
Keyword:
neurodynamic
canonical polyadic decomposition
particle swarm optimization
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
引用论文
A nonnegative matrix factorization algorithm based on a discrete-time projection neural network.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏
分享收藏分享收藏
查看更多内容