scholar.google.com › citations
Jul 2, 2018 � We introduce a tensor completion algorithm that uses a group-sparse regularizer with respect to the PARAFAC factors and is based on an�...
Abstract—We introduce a tensor completion algorithm that uses a group-sparse regularizer with respect to the PARAFAC factors and is based on an optimization�...
A tensor completion algorithm that uses a group-sparse regularizer with respect to the PARAFAC factors and is based on an optimization scheme that�...
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�...
May 11, 2021 � In this paper, the low-complexity tensor completion (LTC) scheme is proposed to improve the efficiency of tensor completion.
Nov 14, 2017 � In this article, we develop methods for estimating a low rank tensor from noisy observations on a subset of its entries to achieve both statistical and�...
Missing: Algorithm. | Show results with:Algorithm.
Abstract—This paper proposes a novel approach to tensor completion, which recovers missing entries of data represented by tensors.
Parallel formulations for ALS, SGD, and CCD++ for tensor completion are presented. •. CCD++ is shown to scale through 16384 cores.
In this article, we develop methods for estimating a low rank tensor from noisy observations on a subset of its entries to achieve both statistical and.
In this survey, we provide a modern overview of recent advances in tensor completion algorithms from the perspective of big data analytics.