Uniqueness of Nonnegative Tensor Approximations
نویسندگان
چکیده
منابع مشابه
Nonnegative approximations of nonnegative tensors
We study the decomposition of a nonnegative tensor into a minimal sum of outer product of nonnegative vectors and the associated parsimonious näıve Bayes probabilistic model. We show that the corresponding approximation problem, which is central to nonnegative parafac, will always have optimal solutions. The result holds for any choice of norms and, under a mild assumption, even Brègman diverge...
متن کاملNonnegative Approximations of Nonnegative Tensors
We study the decomposition of a nonnegative tensor into a minimal sum of outer product of nonnegative vectors and the associated parsimonious näıve Bayes probabilistic model. We show that the corresponding approximation problem, which is central to nonnegative parafac, will always have optimal solutions. The result holds for any choice of norms and, under a mild assumption, even Brègman diverge...
متن کاملAlgorithms for Nonnegative Tensor Factorization
Nonnegative Matrix Factorization (NMF) is an efficient technique to approximate a large matrix containing only nonnegative elements as a product of two nonnegative matrices of significantly smaller size. The guaranteed nonnegativity of the factors is a distinctive property that other widely used matrix factorization methods do not have. Matrices can also be seen as second-order tensors. For som...
متن کاملNonnegative Matrix and Tensor Factorization
T here has been a recent surge of interest in matrix and tensor factorization (decomposition), which provides meaningful latent (hidden) components or features with physical or physiological meaning and interpretation. Nonnegative matrix factorization (NMF) and its extension to three-dimensional (3-D) nonnegative tensor factorization (NTF) attempt to recover hidden nonnegative common structures...
متن کاملBest subspace tensor approximations
In many applications such as data compression, imaging or genomic data analysis, it is important to approximate a given tensor by a tensor that is sparsely representable. For matrices, i.e. 2-tensors, such a representation can be obtained via the singular value decomposition which allows to compute the best rank k approximations. For t-tensors with t > 2 many generalizations of the singular val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2016
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2016.2532906