Back to Search
Start Over
Approximate tensor decomposition within a tensor-relational algebraic framework
Approximate tensor decomposition within a tensor-relational algebraic framework
- Source :
- CIKM
- Publication Year :
- 2011
- Publisher :
- ACM, 2011.
-
Abstract
- In this paper, we first introduce a tensor-based relational data model and define algebraic operations on this model. We note that, while in traditional relational algebraic systems the join operation tends to be the costliest operation of all, in the tensor-relational framework presented here, tensor decomposition becomes the computationally costliest operation. Therefore, we consider optimization of tensor decomposition operations within a relational algebraic framework. This leads to a highly efficient, effective, and easy-to-parallelize join-by-decomposition approach and a corresponding KL-divergence based optimization strategy. Experimental results provide evidence that minimizing KL-divergence within the proposed join-by-decomposition helps approximate the conventional join-then-decompose scheme well, without the associated time and space costs.
Details
- Database :
- OpenAIRE
- Journal :
- Proceedings of the 20th ACM international conference on Information and knowledge management
- Accession number :
- edsair.doi...........8940c750be24a4480ebe6b3498afa927
- Full Text :
- https://doi.org/10.1145/2063576.2063827