3 Citations (Scopus)

Abstract

Tensors (multi-dimensional arrays) are widely used for representing high-order dimensional data, in applications ranging from social networks, sensor data, and Internet traffic. Multi-way data analysis techniques, in particular tensor decompositions, allow extraction of hidden correlations among multi-way data and thus are key components of many data analysis frameworks. Intuitively, these algorithms can be thought of as multi-way clustering schemes, which consider multiple facets of the data in identifying clusters, their weights, and contributions of each data element. Unfortunately, algorithms for fitting multi-way models are, in general, iterative and very time consuming. In this paper, we observe that, in many applications, there is a priori background knowledge (or metadata) about one or more domain dimensions. This metadata is often in the form of a hierarchy that clusters the elements of a given data facet (or mode). In this paper, we investigate whether such single-mode data hierarchies can be used to boost the efficiency of tensor decomposition process, without significant impact on the final decomposition quality. We consider each domain hierarchy as a guide to help provide higher- or lower-resolution views of the data in the tensor on demand and we rely on these metadata-induced multi-resolution tensor representations to develop a multiresolution approach to tensor decomposition. In this paper, we focus on an alternating least squares (ALS) based implementation of the PARAllel FACtors (PARAFAC) decomposition (which decomposes a tensor into a diagonal tensor and a set of factor matrices). Experiment results show that, when the available metadata is used as a rough guide, the proposed multiresolution method helps fit PARAFAC models with consistent (for both dense and sparse tensor representations, under different parameters settings) savings in execution time and memory consumption, while preserving the quality of the decomposition.

Original languageEnglish (US)
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages1275-1284
Number of pages10
DOIs
StatePublished - 2011
Event20th ACM Conference on Information and Knowledge Management, CIKM'11 - Glasgow, United Kingdom
Duration: Oct 24 2011Oct 28 2011

Other

Other20th ACM Conference on Information and Knowledge Management, CIKM'11
CountryUnited Kingdom
CityGlasgow
Period10/24/1110/28/11

Fingerprint

Metadata
Decomposition
Factors
Clustering
Least squares
Sensor
World Wide Web
Savings
Experiment
Social networks

Keywords

  • multiresolution
  • PARAFAC
  • tensor decomposition

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Schifanella, C., Candan, K., & Sapino, M. L. (2011). Fast metadata-driven multiresolution tensor decomposition. In International Conference on Information and Knowledge Management, Proceedings (pp. 1275-1284) https://doi.org/10.1145/2063576.2063762

Fast metadata-driven multiresolution tensor decomposition. / Schifanella, Claudio; Candan, Kasim; Sapino, Maria Luisa.

International Conference on Information and Knowledge Management, Proceedings. 2011. p. 1275-1284.

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

Schifanella, C, Candan, K & Sapino, ML 2011, Fast metadata-driven multiresolution tensor decomposition. in International Conference on Information and Knowledge Management, Proceedings. pp. 1275-1284, 20th ACM Conference on Information and Knowledge Management, CIKM'11, Glasgow, United Kingdom, 10/24/11. https://doi.org/10.1145/2063576.2063762
Schifanella C, Candan K, Sapino ML. Fast metadata-driven multiresolution tensor decomposition. In International Conference on Information and Knowledge Management, Proceedings. 2011. p. 1275-1284 https://doi.org/10.1145/2063576.2063762
Schifanella, Claudio ; Candan, Kasim ; Sapino, Maria Luisa. / Fast metadata-driven multiresolution tensor decomposition. International Conference on Information and Knowledge Management, Proceedings. 2011. pp. 1275-1284
@inproceedings{55bc54c670794b0fba8eee5c8aad0cd0,
title = "Fast metadata-driven multiresolution tensor decomposition",
abstract = "Tensors (multi-dimensional arrays) are widely used for representing high-order dimensional data, in applications ranging from social networks, sensor data, and Internet traffic. Multi-way data analysis techniques, in particular tensor decompositions, allow extraction of hidden correlations among multi-way data and thus are key components of many data analysis frameworks. Intuitively, these algorithms can be thought of as multi-way clustering schemes, which consider multiple facets of the data in identifying clusters, their weights, and contributions of each data element. Unfortunately, algorithms for fitting multi-way models are, in general, iterative and very time consuming. In this paper, we observe that, in many applications, there is a priori background knowledge (or metadata) about one or more domain dimensions. This metadata is often in the form of a hierarchy that clusters the elements of a given data facet (or mode). In this paper, we investigate whether such single-mode data hierarchies can be used to boost the efficiency of tensor decomposition process, without significant impact on the final decomposition quality. We consider each domain hierarchy as a guide to help provide higher- or lower-resolution views of the data in the tensor on demand and we rely on these metadata-induced multi-resolution tensor representations to develop a multiresolution approach to tensor decomposition. In this paper, we focus on an alternating least squares (ALS) based implementation of the PARAllel FACtors (PARAFAC) decomposition (which decomposes a tensor into a diagonal tensor and a set of factor matrices). Experiment results show that, when the available metadata is used as a rough guide, the proposed multiresolution method helps fit PARAFAC models with consistent (for both dense and sparse tensor representations, under different parameters settings) savings in execution time and memory consumption, while preserving the quality of the decomposition.",
keywords = "multiresolution, PARAFAC, tensor decomposition",
author = "Claudio Schifanella and Kasim Candan and Sapino, {Maria Luisa}",
year = "2011",
doi = "10.1145/2063576.2063762",
language = "English (US)",
isbn = "9781450307178",
pages = "1275--1284",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - Fast metadata-driven multiresolution tensor decomposition

AU - Schifanella, Claudio

AU - Candan, Kasim

AU - Sapino, Maria Luisa

PY - 2011

Y1 - 2011

N2 - Tensors (multi-dimensional arrays) are widely used for representing high-order dimensional data, in applications ranging from social networks, sensor data, and Internet traffic. Multi-way data analysis techniques, in particular tensor decompositions, allow extraction of hidden correlations among multi-way data and thus are key components of many data analysis frameworks. Intuitively, these algorithms can be thought of as multi-way clustering schemes, which consider multiple facets of the data in identifying clusters, their weights, and contributions of each data element. Unfortunately, algorithms for fitting multi-way models are, in general, iterative and very time consuming. In this paper, we observe that, in many applications, there is a priori background knowledge (or metadata) about one or more domain dimensions. This metadata is often in the form of a hierarchy that clusters the elements of a given data facet (or mode). In this paper, we investigate whether such single-mode data hierarchies can be used to boost the efficiency of tensor decomposition process, without significant impact on the final decomposition quality. We consider each domain hierarchy as a guide to help provide higher- or lower-resolution views of the data in the tensor on demand and we rely on these metadata-induced multi-resolution tensor representations to develop a multiresolution approach to tensor decomposition. In this paper, we focus on an alternating least squares (ALS) based implementation of the PARAllel FACtors (PARAFAC) decomposition (which decomposes a tensor into a diagonal tensor and a set of factor matrices). Experiment results show that, when the available metadata is used as a rough guide, the proposed multiresolution method helps fit PARAFAC models with consistent (for both dense and sparse tensor representations, under different parameters settings) savings in execution time and memory consumption, while preserving the quality of the decomposition.

AB - Tensors (multi-dimensional arrays) are widely used for representing high-order dimensional data, in applications ranging from social networks, sensor data, and Internet traffic. Multi-way data analysis techniques, in particular tensor decompositions, allow extraction of hidden correlations among multi-way data and thus are key components of many data analysis frameworks. Intuitively, these algorithms can be thought of as multi-way clustering schemes, which consider multiple facets of the data in identifying clusters, their weights, and contributions of each data element. Unfortunately, algorithms for fitting multi-way models are, in general, iterative and very time consuming. In this paper, we observe that, in many applications, there is a priori background knowledge (or metadata) about one or more domain dimensions. This metadata is often in the form of a hierarchy that clusters the elements of a given data facet (or mode). In this paper, we investigate whether such single-mode data hierarchies can be used to boost the efficiency of tensor decomposition process, without significant impact on the final decomposition quality. We consider each domain hierarchy as a guide to help provide higher- or lower-resolution views of the data in the tensor on demand and we rely on these metadata-induced multi-resolution tensor representations to develop a multiresolution approach to tensor decomposition. In this paper, we focus on an alternating least squares (ALS) based implementation of the PARAllel FACtors (PARAFAC) decomposition (which decomposes a tensor into a diagonal tensor and a set of factor matrices). Experiment results show that, when the available metadata is used as a rough guide, the proposed multiresolution method helps fit PARAFAC models with consistent (for both dense and sparse tensor representations, under different parameters settings) savings in execution time and memory consumption, while preserving the quality of the decomposition.

KW - multiresolution

KW - PARAFAC

KW - tensor decomposition

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

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

U2 - 10.1145/2063576.2063762

DO - 10.1145/2063576.2063762

M3 - Conference contribution

AN - SCOPUS:83055186918

SN - 9781450307178

SP - 1275

EP - 1284

BT - International Conference on Information and Knowledge Management, Proceedings

ER -