Adaptive Granularity in Tensors: A Quest for Interpretable Structure

12/19/2019
by   Ravdeep Pasricha, et al.
0

Data collected at very frequent intervals is usually extremely sparse and has no structure that is exploitable by modern tensor decomposition algorithms. Thus the utility of such tensors is low, in terms of the amount of interpretable and exploitable structure that one can extract from them. In this paper, we introduce the problem of finding a tensor of adaptive aggregated granularity that can be decomposed to reveal meaningful latent concepts (structures) from datasets that, in their original form, are not amenable to tensor analysis. Such datasets fall under the broad category of sparse point processes that evolve over space and/or time. To the best of our knowledge, this is the first work that explores adaptive granularity aggregation in tensors. Furthermore, we formally define the problem and discuss what different definitions of "good structure" can be in practice, and show that optimal solution is of prohibitive combinatorial complexity. Subsequently, we propose an efficient and effective greedy algorithm which follows a number of intuitive decision criteria that locally maximize the "goodness of structure", resulting in high-quality tensors. We evaluate our method on both semi-synthetic data where ground truth is known and real datasets for which we do not have any ground truth. In both cases, our proposed method constructs tensors that have very high structure quality. Finally, our proposed method is able to discover different natural resolutions of a multi-aspect dataset, which can lead to multi-resolution analysis.

READ FULL TEXT
research
12/14/2020

Spectral Partitioning of Large and Sparse Tensors using Low-Rank Tensor Approximation

The problem of partitioning a large and sparse tensor is considered, whe...
research
06/01/2023

Faster Robust Tensor Power Method for Arbitrary Order

Tensor decomposition is a fundamental method used in various areas to de...
research
05/21/2020

Sparse Tensor Transpositions

We present a new algorithm for transposing sparse tensors called Quesadi...
research
03/11/2015

Automatic Unsupervised Tensor Mining with Quality Assessment

A popular tool for unsupervised modelling and mining multi-aspect data i...
research
10/14/2019

An Efficient Tensor Completion Method via New Latent Nuclear Norm

In tensor completion, the latent nuclear norm is commonly used to induce...
research
11/14/2020

RecTen: A Recursive Hierarchical Low Rank Tensor Factorization Method to Discover Hierarchical Patterns in Multi-modal Data

How can we expand the tensor decomposition to reveal a hierarchical stru...
research
07/06/2020

Tensor Convolutional Sparse Coding with Low-Rank activations, an application to EEG analysis

Recently, there has been growing interest in the analysis of spectrogram...

Please sign up or login with your details

Forgot password? Click here to reset