Algorithms for an Efficient Tensor Biclustering
Abstract
Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tensor biclustering problem computes a subset of individuals and a subset of features whose signal trajectories over time lie in a low-dimensional subspace, modeling similarity among the signal trajectories while allowing different scalings across different individuals or different features. This approach are based on spectral decomposition in order to build the desired biclusters. We evaluate the quality of the results from each algorithms with both synthetic and real data set.
Cite
@article{arxiv.1903.04042,
title = {Algorithms for an Efficient Tensor Biclustering},
author = {Andriantsiory Dina Faneva and Mustapha Lebbah and Hanane Azzag and Gaël Beck},
journal= {arXiv preprint arXiv:1903.04042},
year = {2019}
}
Comments
Algorithms available on Clustering4Ever github, https://github.com/Clustering4Ever/Clustering4Ever