A Faster Without Scarifying Accuracy Online Decomposition Approach For Higher-Order Tensors
Tensors could be very suitable for representing multidimensional data.In recent years,CANDE-COMP/PARAFAC(CP)decomposition which is one of the most popular methods for Multidimensional Data Analysis has been widely studied and extensively applied.However,todays 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 thir-dorder 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-the-art 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.
Yiwei Xu Yonggen Gu Duc Minh Quan Do Hongtianchen Xie Lunke Qing
Department of computer science,HangZhou DianZi University,Zhe-Jiang China School of Information Engineering,Huzhou University,ZheJiang China A/DRsch Advanced Analytics Institute,University of Technology Sydney,Sydney,Australia
国际会议
南京
英文
159-166
2017-10-12（万方平台首次上网日期，不代表论文的发表时间）