Results 231 to 240 of about 9,784 (260)

A Rank-One Tensor Updating Algorithm for Tensor Completion

IEEE Signal Processing Letters, 2015
In this letter, we propose a rank-one tensor updating algorithm for solving tensor completion problems. Unlike the existing methods which penalize the tensor by using the sum of nuclear norms of unfolding matrices, our optimization model directly employs the tensor nuclear norm which is studied recently.
Yuning Yang, Yunlong Feng, Johan A. K. Suykens   +2 more
openaire   +1 more source

Automorphisms of Tensor Completions of Algebras

Algebra and Logic, 2005
Summary: In the classical representation of different groups, frequent use is made of a linear automorphism group of various algebras. Since the linear automorphism group is only part of a full automorphism group, such an approach might seem to be too restrictive.
openaire   +2 more sources

An Adaptive Correction Approach for Tensor Completion

SIAM Journal on Imaging Sciences, 2016
Summary: In this paper, we study the tensor completion problem on recovery of the multilinear data under limited sampling. A popular convex relaxation of this problem is to minimize the nuclear norm of the more square matrix produced by matricizing a tensor. However, it may fail to produce a highly accurate solution under low sample ratio.
Minru Bai, Xiongjun Zhang, Guyan Ni, Chunfeng Cui   +3 more
openaire   +1 more source

Tensor rank is NP-complete

Journal of Algorithms, 1989
We prove that computing the rank of a three-dimensional tensor over any finite field is NP-complete. Over the rational numbers the problem is NP-hard.
openaire   +1 more source

TENSOR COMPLETION FOR A CERTAIN CLASS OF GROUPS

International Journal of Algebra and Computation, 1996
In this paper we construct the tensor A-completion over an arbitrary torsion-free ring A for groups whose maximal abelian subgroups are either conjugate separated or A-modules. As a corollary, this result gives us an explicit description of the structure of tensor completion for groups of the form F/N′, in particular, for free solvable groups. We also
openaire   +2 more sources

ON TENSOR PRODUCTS OF MONOTONE COMPLETE ALGEBRAS

The Quarterly Journal of Mathematics, 1984
Over thirty years ago, Kaplansky initiated the study of \(AW^*\)-algebras and, in particular, extended the Murray-von Neumann classification to those more general algebras. He gave a complete analysis of Type I \(AW^*\)-algebras and showed that an \({\mathcal N}\)-homogeneous Type I \(AW^*\)-algebra may be regarded as an \({\mathcal N}\times {\mathcal ...
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire   +1 more source

Multi-Aspect Streaming Tensor Completion

Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2017
Tensor completion has become an effective computational tool in many real-world data-driven applications. Beyond traditional static setting, with the increasing popularity of high velocity streaming data, it requires efficient online processing without reconstructing the whole model from scratch.
Qingquan Song, Xiao Huang 0001, Hancheng Ge, James Caverlee, Xia Hu 0001   +4 more
openaire   +1 more source

Tensor Wheel Decomposition and Its Tensor Completion Application

Advances in Neural Information Processing Systems 35, 2022
Zhong-Cheng Wu, Ting-Zhu Huang, Liang-Jian Deng, Hong-Xia Dou, Deyu Meng   +4 more
openaire   +2 more sources

Nonlocal Low-Rank Tensor Completion for Visual Data

IEEE Transactions on Cybernetics, 2021
Bo Du, Lefei Zhang
exaly  

Tensor completion via tensor QR decomposition and L2,1-norm minimization

Signal Processing, 2021
An-Bao Xu
exaly