Zusammenfassung
In this work we present a novel algorithm for nonnegative tensor factorization (NTF). Standard NTF algorithms are very restricted in the size of tensors that can be decomposed. Our algorithm overcomes this size restriction by interpreting the tensor as a set of sub-tensors and by proceeding the decomposition of sub-tensor by sub-tensor. This approach requires only one sub-tensor at once to be available in memory. (C) 2017 Elsevier B.V. All rights reserved.
Nur für Besitzer und Autoren: Kontrollseite des Eintrags