Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data

doi:10.1109/TCYB.2014.2374695

Return

Trace Norm Regularized CANDECOMP/PARAFAC Decomposition With Missing Data

2015-11-01

PRE

DOI：10.1109/TCYB.2014.2374695

Original

Original request for help

Save

Abstract

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.

Keywords:

Alternating direction method of multipliers (ADMM)

CANDECOMP/PARAFAC (CP) decomposition

low-rank

tensor completion

trace norm minimization

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.