8 Citations (Scopus)

Abstract

For many multi-dimensional data applications, tensor operations as well as relational operations need to be supported throughout the data lifecycle. Although tensor decomposition is shown to be effective for multi-dimensional data analysis, the cost of tensor decomposition is often very high. We propose a novel decomposition-by-normalization scheme that first normalizes the given relation into smaller tensors based on the functional dependencies of the relation and then performs the decomposition using these smaller tensors. The decomposition and recombination steps of the decomposition-by- normalization scheme fit naturally in settings with multiple cores. This leads to a highly efficient, effective, and parallelized decomposition-by-normalization algorithm for both dense and sparse tensors. Experiments confirm the efficiency and effectiveness of the proposed decomposition-by-normalization scheme compared to the conventional nonnegative CP decomposition approach.

Original languageEnglish (US)
Title of host publicationACM International Conference Proceeding Series
Pages355-364
Number of pages10
DOIs
StatePublished - 2012
Event21st ACM International Conference on Information and Knowledge Management, CIKM 2012 - Maui, HI, United States
Duration: Oct 29 2012Nov 2 2012

Other

Other21st ACM International Conference on Information and Knowledge Management, CIKM 2012
CountryUnited States
CityMaui, HI
Period10/29/1211/2/12

Fingerprint

Tensors
Decomposition
Costs

Keywords

  • tensor decomposition
  • tensor-based relational data model

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Decomposition-by-normalization (DBN) : Leveraging approximate functional dependencies for efficient tensor decomposition. / Kim, Mijung; Candan, Kasim.

ACM International Conference Proceeding Series. 2012. p. 355-364.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, M & Candan, K 2012, Decomposition-by-normalization (DBN): Leveraging approximate functional dependencies for efficient tensor decomposition. in ACM International Conference Proceeding Series. pp. 355-364, 21st ACM International Conference on Information and Knowledge Management, CIKM 2012, Maui, HI, United States, 10/29/12. https://doi.org/10.1145/2396761.2396809
@inproceedings{ac6e4b159c8b445cb31c245ef02e9a16,
title = "Decomposition-by-normalization (DBN): Leveraging approximate functional dependencies for efficient tensor decomposition",
abstract = "For many multi-dimensional data applications, tensor operations as well as relational operations need to be supported throughout the data lifecycle. Although tensor decomposition is shown to be effective for multi-dimensional data analysis, the cost of tensor decomposition is often very high. We propose a novel decomposition-by-normalization scheme that first normalizes the given relation into smaller tensors based on the functional dependencies of the relation and then performs the decomposition using these smaller tensors. The decomposition and recombination steps of the decomposition-by- normalization scheme fit naturally in settings with multiple cores. This leads to a highly efficient, effective, and parallelized decomposition-by-normalization algorithm for both dense and sparse tensors. Experiments confirm the efficiency and effectiveness of the proposed decomposition-by-normalization scheme compared to the conventional nonnegative CP decomposition approach.",
keywords = "tensor decomposition, tensor-based relational data model",
author = "Mijung Kim and Kasim Candan",
year = "2012",
doi = "10.1145/2396761.2396809",
language = "English (US)",
isbn = "9781450311564",
pages = "355--364",
booktitle = "ACM International Conference Proceeding Series",

}

TY - GEN

T1 - Decomposition-by-normalization (DBN)

T2 - Leveraging approximate functional dependencies for efficient tensor decomposition

AU - Kim, Mijung

AU - Candan, Kasim

PY - 2012

Y1 - 2012

N2 - For many multi-dimensional data applications, tensor operations as well as relational operations need to be supported throughout the data lifecycle. Although tensor decomposition is shown to be effective for multi-dimensional data analysis, the cost of tensor decomposition is often very high. We propose a novel decomposition-by-normalization scheme that first normalizes the given relation into smaller tensors based on the functional dependencies of the relation and then performs the decomposition using these smaller tensors. The decomposition and recombination steps of the decomposition-by- normalization scheme fit naturally in settings with multiple cores. This leads to a highly efficient, effective, and parallelized decomposition-by-normalization algorithm for both dense and sparse tensors. Experiments confirm the efficiency and effectiveness of the proposed decomposition-by-normalization scheme compared to the conventional nonnegative CP decomposition approach.

AB - For many multi-dimensional data applications, tensor operations as well as relational operations need to be supported throughout the data lifecycle. Although tensor decomposition is shown to be effective for multi-dimensional data analysis, the cost of tensor decomposition is often very high. We propose a novel decomposition-by-normalization scheme that first normalizes the given relation into smaller tensors based on the functional dependencies of the relation and then performs the decomposition using these smaller tensors. The decomposition and recombination steps of the decomposition-by- normalization scheme fit naturally in settings with multiple cores. This leads to a highly efficient, effective, and parallelized decomposition-by-normalization algorithm for both dense and sparse tensors. Experiments confirm the efficiency and effectiveness of the proposed decomposition-by-normalization scheme compared to the conventional nonnegative CP decomposition approach.

KW - tensor decomposition

KW - tensor-based relational data model

UR - http://www.scopus.com/inward/record.url?scp=84871037251&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84871037251&partnerID=8YFLogxK

U2 - 10.1145/2396761.2396809

DO - 10.1145/2396761.2396809

M3 - Conference contribution

SN - 9781450311564

SP - 355

EP - 364

BT - ACM International Conference Proceeding Series

ER -