中国邮电高校学报(英文) ›› 2021, Vol. 28 ›› Issue (1): 10-23.doi: 10.19682/j.cnki.1005-8885.2021.0003

• Artificial Intelligence • 上一篇    下一篇

Incremental QR-based tensor-train decomposition for industrial big data

陈彦萍1,靳晓东2,夏虹2,王忠民1   

  1. 1. 西安邮电学院
    2. 西安邮电大学
  • 收稿日期:2020-05-12 修回日期:2020-08-09 出版日期:2021-02-28 发布日期:2021-03-28
  • 通讯作者: 夏虹 E-mail:xiahong@xupt.edu.cn
  • 基金资助:

    This work was supported by the Science and Technology Project in Shaanxi Province of China (2019ZDLGY07-08), the

    Natural Science Foundation Research Program of Shaanxi Province, China.


Incremental QR-based tensor-train decomposition for industrial big data

#br#   

  1. 1. School of Computer Technology, Xi'an University of Posts and Telecommunications, Xi'an 710121, China 2. Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing, Xi'an University of Posts and Telecommunications, Xi'an 710121, China
  • Received:2020-05-12 Revised:2020-08-09 Online:2021-02-28 Published:2021-03-28
  • Contact: hong Xia E-mail:xiahong@xupt.edu.cn
  • Supported by:

    This work was supported by the Science and Technology Project in Shaanxi Province of China (2019ZDLGY07-08), the

    Natural Science Foundation Research Program of Shaanxi Province, China.



摘要:

Industrial big data was usually multi-source, heterogeneous, and deeply intertwined. It had a wide range of data sources, high data dimensions, and strong data correlation. In order to effectively analyze and process streaming industrial big data generated by edge computing, it was very important to provide an effective real-time incremental data method. However, in the process of incremental processing, industrial big data incremental computing faced the challenges of dimensional disaster, repeated calculations, and the explosion of intermediate results. Therefore, in order to solve the above problems effectively, a QR-based tensor-train (TT) decomposition (TTD) method and a QR-based incremental TTD (QRITTD) method were proposed. This algorithm combined the incremental QR-based decomposition algorithm with an approximate singular value decomposition ( SVD) algorithm and had good scalability. In addition, the computational complexity, space complexity, and approximation error analysis were analyzed in detail. The effectiveness of the three algorithms of QRITTD, non-incremental TTD (NITTD), and TT rank-1 (TTr1) SVD (TTr1SVD)were verified by  comparison. Experimental results show that the SVD QRITTD method has better performance under the premise of ensuring the same tensor size.

关键词:

tensor-train decomposed| incremental processing| edge computing| industrial big data


Abstract:

Industrial big data was usually multi-source, heterogeneous, and deeply intertwined. It had a wide range of data sources, high data dimensions, and strong data correlation. In order to effectively analyze and process streaming industrial big data generated by edge computing, it was very important to provide an effective real-time incremental data method. However, in the process of incremental processing, industrial big data incremental computing faced the challenges of dimensional disaster, repeated calculations, and the explosion of intermediate results. Therefore, in order to solve the above problems effectively, a QR-based tensor-train (TT) decomposition (TTD) method and a QR-based incremental TTD (QRITTD) method were proposed. This algorithm combined the incremental QR-based decomposition algorithm with an approximate singular value decomposition ( SVD) algorithm and had good scalability. In addition, the computational complexity, space complexity, and approximation error analysis were analyzed in detail. The effectiveness of the three algorithms of QRITTD, non-incremental TTD (NITTD), and TT rank-1 (TTr1) SVD (TTr1SVD)were verified by  comparison. Experimental results show that the SVD QRITTD method has better performance under the premise of ensuring the same tensor size.

Key words: tensor-train decomposed| incremental processing| edge computing| industrial big data