.png){kind=icon}
返回
A Computationally Efficient Tensor Completion Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2018.2852490.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce a tensor completion algorithm that uses a group-sparse regularizer with respect to the PARAFAC factors and is based on an optimization scheme that alternatingly minimizes a quadratic upper bound of the associated cost function. The proposed scheme allows matrixwise updates of the PARAFAC factors and, thus, leads to an efficient and scalable iterative algorithm, suitable for big-data applications. Experiments conducted on both synthetic and real data, corroborate the superior performance, in terms of runtime, of the proposed algorithm as compared with the other state-of-the-art approaches.
Keyword:
BSUM framework
group-sparse regularization
PARAFAC decomposition
tensor completion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
分享收藏Resolution and optical properties ([α]max, ord and cd) of hepta-, octa- and nonahelicene.png)
Tetrahedron
TetrahedronIF0
PREAI
分享收藏
查看更多内容