Nonnegative Canonical Tensor Decomposition with Linear Constraints: nnCANDELINC
From MaRDI portal
Publication:6325442
DOI10.1002/NLA.2443arXiv1909.07570WikidataQ114235397 ScholiaQ114235397MaRDI QIDQ6325442FDOQ6325442
Gianmarco Manzini, Derek DeSantis, Erik Skau, Boian S. Alexandrov
Publication date: 16 September 2019
Abstract: There is an emerging interest in tensor factorization applications in big-data analytics and machine learning. To speed up the factorization of extra-large datasets, organized in multidimensional arrays (aka tensors), easy to compute compression-based tensor representations, such as Tucker and Tensor Train formats, are used to approximate the initial large-tensor. Further, tensor factorization is used to extract latent features that can facilitate discoveries of new mechanisms and signatures hidden in the data, where the explainability of the latent features is of principal importance. Nonnegative tensor factorization extracts latent features that are naturally sparse and parts of the data, which makes them easily interpretable. However, to take into account available domain knowledge and subject matter expertise, additional constraints often need to be imposed, which lead us to Canonical decomposition with linear constraints (CANDELINC), a Canonical Polyadic Decomposition with rank deficient factors. In CANDELINC, Tucker compression is used as a pre-processing step, which leads to a larger residual error but to more explainable latent features. Here, we propose a nonnegative CANDELINC (nnCANDELINC) accomplished via a specific nonnegative Tucker decomposition; we refer to as minimal or canonical nonnegative Tucker. We derive several results required to understand the specificity of nnCANDELINC, focusing on the difficulties of preserving the nonnegative rank to its Tucker core and comparing the real-valued to the nonnegative case. Finally, we demonstrate nnCANDELINC performance on synthetic and real-world examples.
This page was built for publication: Nonnegative Canonical Tensor Decomposition with Linear Constraints: nnCANDELINC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325442)
