Tensor Completion Algorithms in Big Data Analytics

Abstract

Tensor completion is a problem of filling the missing or unobserved entries of partially observed tensors. Due to the multidimensional character of tensors in describing complex datasets, tensor completion algorithms and their applications have received wide attention and achievement in areas like data mining, computer vision, signal processing, and neuroscience. In this survey, we provide a modern overview of recent advances in tensor completion algorithms from the perspective of big data analytics characterized by diverse variety, large volume, and high velocity. We characterize these advances from four perspectives: general tensor completion algorithms, tensor completion with auxiliary information (variety), scalable tensor completion algorithms (volume), and dynamic tensor completion algorithms (velocity). Further, we identify several tensor completion applications on real-world data-driven problems and present some common experimental frameworks popularized in the literature. Our goal is to summarize these popular methods and introduce them to researchers and practitioners for promoting future research and applications. We conclude with a discussion of key challenges and promising research directions in this community for future exploration.

References in corpus (16)

• Tensor Decomposition for Signal Processing and Machine Learning
• Subspace Learning and Imputation for Streaming Big Data Matrices and Tensors
• Provable Tensor Factorization with Missing Data
• Hankel Matrix Nuclear Norm Regularized Tensor Completion for $N$-dimensional Exponential Signals
• Low-rank tensor completion: a Riemannian manifold preconditioning approach
• DFacTo: Distributed Factorization of Tensors
• Online Low-Rank Tensor Subspace Tracking from Incomplete Data by CP Decomposition using Recursive Least Squares
• Novel methods for multilinear data completion and de-noising based on tensor-SVD
• Stable, Robust and Super Fast Reconstruction of Tensors Using Multi-Way Projections
• A New Sampling Technique for Tensors
• Link Prediction via Generalized Coupled Tensor Factorisation
• Efficient tensor completion: Low-rank tensor train
• On Polynomial Time Methods for Exact Low Rank Tensor Completion
• Spectral algorithms for tensor completion
• Alternating Least Squares Tensor Completion in The TT-Format
• Incoherent Tensor Norms and Their Applications in Higher Order Tensor Completion

Cited by in corpus (2)

• FasTer: Fast Tensor Completion with Nonconvex Regularization
• Protecting Big Data Privacy Using Randomized Tensor Network Decomposition and Dispersed Tensor Computation