mlsanityData to 14 Oct 2026

OCTen: Online Compression-based Tensor Decomposition

arXiv 1807.01350 ↗First posted 3 Jul 2018cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

Tensor decompositions are powerful tools for large data analytics as they jointly model multiple aspects of data into one framework and enable the discovery of the latent structures and higher-order correlations within the data. One of the most widely studied and used decompositions, especially in data mining and machine learning, is the Canonical Polyadic or CP decomposition. However, today's datasets are not static and these datasets often dynamically growing and changing with time. To operate on such large data, we present OCTen the first ever compression-based online parallel implementation for the CP decomposition. We conduct an extensive empirical analysis of the algorithms in terms of fitness, memory used and CPU time, and in order to demonstrate the compression and scalability of the method, we apply OCTen to big tensor data. Indicatively, OCTen performs on-par or better than state-of-the-art online and online methods in terms of decomposition accuracy and efficiency, while saving up to 40-200 % memory space.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 3 Jul 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2022: 2.

2 papers.