A neural tensor decomposition model for high-order sparse data recovery

DOI10.1016/J.INS.2023.120024OpenAlexW4390116388MaRDI QIDQ6153224FDOQ6153224

Authors: Tianchi Liao, Jing Hua Yang, Chuan Chen, Zibin Zheng 

Publication date: 13 February 2024

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2023.120024

zbMATH Keywords

tensor completionconvolutional neural networksrank robustnesstensor-ring decomposition

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Cites Work

• Title not available (Why is that?)
• Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
• Tensor Decompositions and Applications
• Tensor-train decomposition
• Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
• A practical introduction to tensor networks: Matrix product states and projected entangled pair states
• Computations in quantum tensor networks
• Tensor Decomposition for Signal Processing and Machine Learning
• Paley inequalities for discrete-time rational orthonormal bases.
• Certain Ostrowski type inequalities for generalized s-convex functions
• Robust Low-Rank Tensor Completion Based on Tensor Ring Rank via $\ell _{p,\epsilon }$-Norm

Cited In (1)

• Relaxation of the rank-1 tensor approximation using different norms

This page was built for publication: A neural tensor decomposition model for high-order sparse data recovery

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6153224)