%0 Journal Article
%A 陈彦萍
%A 靳晓东
%A 王忠民
%A 夏虹
%T 	Incremental QR-based tensor-train decomposition for industrial big data

%D 2021
%R 10.19682/j.cnki.1005-8885.2021.0003
%J 中国邮电高校学报（英文）
%P 10-23
%V 28
%N 1
%X <p style="text-align:justify;">
	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 &nbsp;comparison. Experimental results show that the SVD QRITTD method has better performance under the premise of ensuring the same tensor size.
</p>
%U https://jcupt.bupt.edu.cn/CN/10.19682/j.cnki.1005-8885.2021.0003