Adaptive granularity in tensors: A quest for interpretable structure
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 thi...
Main Authors: | Ravdeep S. Pasricha, Ekta Gujral, Evangelos E. Papalexakis |
---|---|
Format: | Article |
Language: | English |
Published: |
Frontiers Media S.A.
2022-11-01
|
Series: | Frontiers in Big Data |
Subjects: | |
Online Access: | https://www.frontiersin.org/articles/10.3389/fdata.2022.929511/full |
Similar Items
-
HOSVD-Based Algorithm for Weighted Tensor Completion
by: Zehan Chao, et al.
Published: (2021-07-01) -
A Hybrid Norm for Guaranteed Tensor Recovery
by: Yihao Luo, et al.
Published: (2022-07-01) -
Dynamic Tensor Modeling for Missing Data Completion in Electronic Toll Collection Gantry Systems
by: Yikang Rui, et al.
Published: (2023-12-01) -
Tensor Decompositions and Their Properties
by: Patrik Peška, et al.
Published: (2023-08-01) -
Thumbnail Tensor—A Method for Multidimensional Data Streams Clustering with an Efficient Tensor Subspace Model in the Scale-Space
by: Bogusław Cyganek
Published: (2019-09-01)