A Faster without Scarifying Accuracy Online Decomposition Approach for Higher-Order Tensors

Publication Type:
Conference Proceeding
Citation:
Proceedings - 2017 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, CyberC 2017, 2018, 2018-January pp. 159 - 166
Issue Date:
2018-01-08
Full metadata record
Files in This Item:
Filename Description Size
08250353.pdfPublished version229.61 kB
Adobe PDF
© 2017 IEEE. Tensors could be very suitable for representing multidimensional data. In recent years, CANDECOMP/PARAFAC (CP) decomposition which is one of the most popular methods for Multidimensional Data Analysis has been widely studied and extensively applied. However, today's datasets will often change dynamically, and the amount of data is showing a trend of exponential growth. It is a very necessary and difficult task to perform a CP decomposition on a dynamically changing tensor with very large scale growth. The traditional and classic methods, such as Alternating Least Squares (ALS) algorithm, cannot be directly used to the dynamical tensor due to their huge consumption of time and memory. In addition, the existing online CP methods can only partially solve this problem and can only be applied to thirdorder tensor. Based on the online CP method, we proposed a simplified online CP decomposition algorithm that can be a good solution to these problems. It not only has the similar decomposition accuracy rate with ALS algorithm but also the decomposition speed faster than the ALS algorithm hundreds of thousands of times. Comparing with other state-of-theart online CP methods, it has better decomposition quality and decomposition speed. The experimental results of four methods show that, our approach reduces computational time significantly without scarifying accuracy. our approach has a similar accuracy rate, and the speed has increased by tens times than online CP decomposition. Even in some datasets, the speed and accuracy of our approach are both better than the other approach.
Please use this identifier to cite or link to this item: