Nonnegative low-rank tensor completion method for spatiotemporal traffic data

被引:4
|
作者
Zhao, Yongmei [1 ,2 ]
Tuo, Mingfu [2 ]
Zhang, Hongmei [2 ]
Zhang, Han [2 ]
Wu, Jiangnan [2 ]
Gao, Fengyin [3 ]
机构
[1] Northwestern Polytech Univ, Sch Comp Sci Engn, Xian, Peoples R China
[2] Air Force Engn Univ, Sch Mat Management & Unmanned Aerial Vehicle Engn, Xian 710051, Peoples R China
[3] Air Force Engn Univ, Foundmental Dept, Xian, Peoples R China
基金
中国国家自然科学基金;
关键词
Low-Rank Tensor Completion; Non-Negative Tensor Completion; Traffic Data; Truncated Nuclear norm; SVD-BASED INITIALIZATION; TUCKER DECOMPOSITION;
D O I
10.1007/s11042-023-15511-w
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Although tensor completion theory performs well with high data missing rates, a lack of attention is encountered at the level of data completion non-negative constraints, and a remaining lack of effective non-negative tensor completion methods is still found. In this article, a new non-negative tensor completion model, based on the low-rank tensor completion theory, called the Nonnegative Weighted Low-Rank Tensor Completion (NWLRTC) method, is proposed. Due to the advantages of Truncated Nuclear Norm (TNN) in low-rank approximation, NWLRTC considers the TNN as the objective optimization function and adds a directional weight factor to the model to avoid its dependency on the data input direction. In addition to considering the completion accuracy, NWLRTC also imposes non-negativity constraints to meet the requirements of practical engineering applications. Finally, NWLRTC is realized by the alternating direction multiplier method. As for the experiments, they are carried out using different methods for generating missing data and for different iteration times. The experimental results show that the NWLRTC algorithm has high completion accuracy at low missing data rates, and it maintains a stable completion accuracy even when the missing rate hits 80%.
引用
收藏
页码:61761 / 61776
页数:16
相关论文
共 50 条
  • [21] Riemannian conjugate gradient method for low-rank tensor completion
    Shan-Qi Duan
    Xue-Feng Duan
    Chun-Mei Li
    Jiao-Fen Li
    Advances in Computational Mathematics, 2023, 49
  • [22] A low-rank tensor completion based method for electromagnetic big data annotation recovery
    Sun G.
    Zhang W.
    Shao H.
    Fang Y.
    Li P.
    Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics, 2024, 46 (02): : 381 - 390
  • [23] Iterative tensor eigen rank minimization for low-rank tensor completion
    Su, Liyu
    Liu, Jing
    Tian, Xiaoqing
    Huang, Kaiyu
    Tan, Shuncheng
    INFORMATION SCIENCES, 2022, 616 : 303 - 329
  • [24] Structured Low-Rank Tensor Completion for IoT Spatiotemporal High-Resolution Sensing Data Reconstruction
    Zhang, Xiaoyue
    He, Jingfei
    Pan, XuanAng
    Chi, Yue
    Zhou, Yatong
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (05): : 8299 - 8310
  • [25] Low-rank tensor completion by Riemannian optimization
    Kressner, Daniel
    Steinlechner, Michael
    Vandereycken, Bart
    BIT NUMERICAL MATHEMATICS, 2014, 54 (02) : 447 - 468
  • [26] CROSS: EFFICIENT LOW-RANK TENSOR COMPLETION
    Zhang, Anru
    ANNALS OF STATISTICS, 2019, 47 (02): : 936 - 964
  • [27] Robust Low-Rank Tensor Ring Completion
    Huang, Huyan
    Liu, Yipeng
    Long, Zhen
    Zhu, Ce
    IEEE TRANSACTIONS ON COMPUTATIONAL IMAGING, 2020, 6 : 1117 - 1126
  • [28] Low-rank tensor completion by Riemannian optimization
    Daniel Kressner
    Michael Steinlechner
    Bart Vandereycken
    BIT Numerical Mathematics, 2014, 54 : 447 - 468
  • [29] Optimal Low-Rank Tensor Tree Completion
    Li, Zihan
    Zhu, Ce
    Long, Zhen
    Liu, Yipeng
    2023 IEEE 25TH INTERNATIONAL WORKSHOP ON MULTIMEDIA SIGNAL PROCESSING, MMSP, 2023,
  • [30] A dual framework for low-rank tensor completion
    Nimishakavi, Madhav
    Jawanpuria, Pratik
    Mishra, Bamdev
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31