Fast DTT
Authors:
Open Access
- 24 August 2014
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 967-976
Abstract
As tensors provide a natural representation for the higher-order relations, tensor factorization techniques such as Tucker decomposition and CANDECOMP/PARAFAC decomposition have been applied to many fields. Tucker decomposition has strong capacity of expression, but the time complexity is unpractical for the large-scale real problems. On the other hand, CANDECOMP/PARAFAC decomposition is linear in the feature dimensionality, but the assumption is so strong that it abandons some important information. Besides, both of TD and CP decompose a tensor into several factor matrices. However, the factor matrices are not natural for the representation of the higher-order relations. To overcome these problems, we propose a near linear tensor factorization approach, which decompose a tensor into factor tensors in order to model the higher-order relations, without loss of important information. In addition, to reduce the time complexity and the number of the parameters, we decompose each slice of the factor tensors into two smaller matrices. We conduct experiments on both synthetic datasets and real datasets. The experimental results on the synthetic datasets validate that our model has strong capacity of expression. The results on the real datasets show that our approach outperforms the state-of-the-art tensor factorization methods.Keywords
Funding Information
- Huawei Technologies
- National Natural Science Foundation of China (61033010)
This publication has 19 references indexed in Scilit:
- Twitter hyperlink recommendation with user-tweet-hyperlink three-way clustering2012
- Temporal Link Prediction Using Matrix and Tensor FactorizationsACM Transactions on Knowledge Discovery From Data, 2011
- Multiverse recommendation2010
- Tensor Decompositions and ApplicationsSIAM Review, 2009
- Decomposing EEG data into space–time–frequency components using Parallel Factor AnalysisNeuroImage, 2004
- A Multilinear Singular Value DecompositionSIAM Journal on Matrix Analysis and Applications, 2000
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order TensorsSIAM Journal on Matrix Analysis and Applications, 2000
- Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluentsAnalytical Chemistry, 1981
- Analysis of Individual Differences in Multidimensional Scaling Via an N-way Generalization of “Eckart-Young” DecompositionPsychometrika, 1970
- Singular value decomposition and least squares solutionsNumerische Mathematik, 1970