Elena M. Shcherbakova

In this article, we introduce eigenvector centralities for higher-order multilayer networks and suggest to use nonnegative tensor train decomposition for fast computations of dominant eigenvectors of multi-homogeneous maps via power iterates. The analysis of the approximation error for using nonnegative tensor train instead of the original nonnegative tensor is presented.

In the present paper we compare two different iterative approaches to constructing nonnegative tensor train and Tucker decompositions. The first approach is based on idea of alternating projections and randomized sketching for factorization of tensors with nonnegative elements. This approach can be useful for both TT and Tucker formats. The second approach consists of two stages. At the first stage we find the unconstrained tensor train decomposition for the target array. At the second stage we use this initial approximation in order to fix it within moderate number of operations and obtain the factorization with nonnegative factors either in tensor train or Tucker model. We study the performance of these methods for both synthetic data and hyper-spectral image and demonstrate the clear advantage of the latter technique in terms of computational time and wider range of possible applications.

Tensor train model is a low-rank approximation for multidimensional data. In this article we demonstrate how it can be succesfully used for fast computation of nonnegative tensor train, nonnegative canonical and nonnegative Tucker factorizations. The proposed approaches can be incorporated in wide range of methods to solve big data problems.

Tensor train is one of the modern decompositions used as low-rank tensor approximations of multidimensional arrays. If the original data is nonnegative we sometimes want the approximant to keep this...

Available methods for nonnegative matrix factorization make use of all elements of the original [equation] matrix, and their complexity is at least [equation]which makes them extremely...