返回
Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data
DOI:10.1109/TCYB.2014.2374695.png)
摘要
En 中文
In recent years, low-rank tensor completion (LRTC) problems have received a significant amount of attention in computer vision, data mining, and signal processing. The existing trace norm minimization algorithms for iteratively solving LRTC problems involve multiple singular value decompositions of very large matrices at each iteration. Therefore, they suffer from high computational cost. In this paper, we propose a novel trace norm regularized CANDECOMP/PARAFAC decomposition (TNCP) method for simultaneous tensor decomposition and completion. We first formulate a factor matrix rank minimization model by deducing the relation between the rank of each factor matrix and the mode-n rank of a tensor. Then, we introduce a tractable relaxation of our rank function, and then achieve a convex combination problem of much smaller-scale matrix trace norm minimization. Finally, we develop an efficient algorithm based on alternating direction method of multipliers to solve our problem. The promising experimental results on synthetic and real-world data validate the effectiveness of our TNCP method. Moreover, TNCP is significantly faster than the state-of-the-art methods and scales to larger problems.
Keyword:
Alternating direction method of multipliers (ADMM)
CANDECOMP/PARAFAC (CP) decomposition
low-rank
tensor completion
trace norm minimization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
DC Offset Error Compensation Algorithm for PR Current Control of a Single-Phase Grid-Tied Inverter
Energies
IF0
Small Silencing RNAs in Plants Are Mobile and Direct Epigenetic Modification in Recipient Cells
Science
IF0
Heavy metal tolerance of marine phytoplankton. IV. Combined effect of zinc and cadmium on growth and uptake in some marine diatoms海洋浮游植物对重金属的耐受性。四。锌和镉对某些海洋硅藻生长和吸收的综合影响

