Accelerating a Distributed CPD Algorithm for Large Dense, Skewed Tensors

BigData, pp. 408-417, 2018.

Cited by: 1|Views15
EI

Abstract:

Canonical Polyadic Decomposition (CPD) is a powerful technique for uncovering multilinear relationships in tensors. Current research in scalable CPD has focused on designing efficient decomposition algorithms for large sparse tensors that arise in machine learning and data mining applications. This work addresses the complementary need fo...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments