Computer Science – Data Structures and Algorithms
Scientific paper
2009-09-27
Computer Science
Data Structures and Algorithms
15 pages, 4 Tables, 6 Figures
Scientific paper
Tensors naturally model many real world processes which generate multi-aspect data. Such processes appear in many different research disciplines, e.g, chemometrics, computer vision, psychometrics and neuroimaging analysis. Tensor decompositions such as the Tucker decomposition are used to analyze multi-aspect data and extract latent factors, which capture the multilinear data structure. Such decompositions are powerful mining tools, for extracting patterns from large data volumes. However, most frequently used algorithms for such decompositions involve the computationally expensive Singular Value Decomposition. In this paper we propose MACH, a new sampling algorithm to compute such decompositions. Our method is of significant practical value for tensor streams, such as environmental monitoring systems, IP traffic matrices over time, where large amounts of data are accumulated and the analysis is computationally intensive but also in "post-mortem" data analysis cases where the tensor does not fit in the available memory. We provide the theoretical analysis of our proposed method, and verify its efficacy in monitoring system applications.
No associations
LandOfFree
MACH: Fast Randomized Tensor Decompositions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with MACH: Fast Randomized Tensor Decompositions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MACH: Fast Randomized Tensor Decompositions will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-234350