A new algorithm by embedding structured data for low-rank tensor ring completion

In this paper, we put up with a new algorithm for tensor completion problems that include missing slices or row/column fibers, where embedding a structured tensor by a multi-way delay-embedding transform (MDT) makes the tensor to be completed have a special structure. The main idea is to employ a tensor completion algorithm based on the tensor ring rank, constructing latent tensor ring factors with a structure that approximates the original tensor starting from the tensor structure. It is also proved that the sequence generated by the new algorithm converges to the optimal solution. Finally, the feasibility of the proposed algorithm is verified by experiments. Compared with other completed algorithms based on tensor ring rank, the completed accuracy is improved, up to 30%.

Authors

Institutions

Publication Details

Journal
AIMS Mathematics
Published
2025-01-01
DOI
https://doi.org/10.3934/math.2025297
Primary Topic
Tensor decomposition and applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new algorithm by embedding structured data for low-rank tensor ring completion

Ruiping Wen, T.-H. Liu, Y. P. Pei
AIMS Mathematics
Tensor decomposition and applications
article

A new algorithm by embedding structured data for low-rank tensor ring completion

Ruiping Wen, T.-H. Liu, Y. P. Pei
article en

Abstract

In this paper, we put up with a new algorithm for tensor completion problems that include missing slices or row/column fibers, where embedding a structured tensor by a multi-way delay-embedding transform (MDT) makes the tensor to be completed have a special structure. The main idea is to employ a tensor completion algorithm based on the tensor ring rank, constructing latent tensor ring factors with a structure that approximates the original tensor starting from the tensor structure. It is also proved that the sequence generated by the new algorithm converges to the optimal solution. Finally, the feasibility of the proposed algorithm is verified by experiments. Compared with other completed algorithms based on tensor ring rank, the completed accuracy is improved, up to 30%.

AIMS MathematicsVol. 10(3)
Taiyuan Normal University (CN), Shanxi University (CN)
Openalex Percentile: Top 92%
Tensor decomposition and applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.