NT-DPTC: A non-negative temporal dimension preserved tensor completion model for missing traffic data imputation

Missing traffic data imputation is an important step in the intelligent transportation systems. Low rank approximation is an important method for the missing traffic data imputation, especially the low rank matrix/tensor completion. However, the low-rank matrix completion has a huge time cost and th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Information sciences 2024-01, Vol.653, p.119797, Article 119797
Hauptverfasser: Chen, Hong, Lin, Mingwei, Liu, Jiaqi, Yang, Hengshuo, Zhang, Chao, Xu, Zeshui
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Missing traffic data imputation is an important step in the intelligent transportation systems. Low rank approximation is an important method for the missing traffic data imputation, especially the low rank matrix/tensor completion. However, the low-rank matrix completion has a huge time cost and the low-rank tensor completion cannot fully extract the information and maintain non-negativity. Therefore, we propose a novel non-negative temporal dimension preserved tensor completion (NT-DPTC) model with ideas: a) proposing a novel dimension preserved (DP) tensor decomposition method, which decomposes a tensor into three latent factor tensors to fully extract the intrinsic feature, b) using a Sigmoid mapper for releasing non-negative constraint from the training process and increasing flexibility, c) exploiting temporal constrains and AdamW schemes for obtaining a higher accuracy and faster convergence. Experiments on four industrial application scenarios highlight the superiority of our proposed model when compared with the existing state-of-the-art models.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2023.119797