Columnwise Element Selection for Computationally Efficient Nonnegative Coupled Matrix Tensor Factorization
Abstract
Coupled Matrix Tensor Factorization (CMTF) facilitates the integration and analysis of multiple data sources and helps discover meaningful information. Nonnegative CMTF (N-CMTF) has been employed in many applications for identifying latent patterns, prediction, and recommendation. However, due to the added complexity with coupling between tensor and matrix data, existing N-CMTF algorithms exhibit poor computation efficiency. In this paper, a computationally efficient N-CMTF factorization algorithm is presented based on the column-wise element selection, preventing frequent gradient updates. Theoretical and empirical analyses show that the proposed N-CMTF factorization algorithm is not only more accurate but also more computationally efficient than existing algorithms in approximating the tensor as well as in identifying the underlying nature of factors.
Cite
@article{arxiv.2003.03506,
title = {Columnwise Element Selection for Computationally Efficient Nonnegative Coupled Matrix Tensor Factorization},
author = {Thirunavukarasu Balasubramaniam and Richi Nayak and Chau Yuen},
journal= {arXiv preprint arXiv:2003.03506},
year = {2020}
}
Comments
To appear in IEEE Transactions on Knowledge and Data Engineering (TKDE)