This paper tackles the problem of decomposing binary data using matrix factorization. We consider family mean-parametrized Bernoulli models, a class generative models that are well suited for modeling and enables interpretability factors. factorize parameter an additional Beta prior on one factors to further improve model's expressive power. While similar have been proposed in literature, they ...

In this paper, we present several descent methods that can be applied to nonnegative matrix factorization and we analyze a recently developped fast block coordinate method called Rank-one Residue Iteration (RRI). We also give a comparison of these different methods and show that the new block coordinate method has better properties in terms of approximation error and complexity. By interpreting...

Nonnegative tensor factorization is an extension of nonnegative matrix factorization(NMF) to a multilinear case, where nonnegative constraints are imposed on the PARAFAC/Tucker model. In this paper, to identify speaker from a noisy environment, we propose a new method based on PARAFAC model called constrained Nonnegative Tensor Factorization (cNTF). Speech signal is encoded as a general higher ...

Data missing usually happens in the process of data collection, transmission, processing, preservation and application due to various reasons. In the research of face recognition, the missing of image pixel value will affect feature extraction. How to extract local feature from the incomplete data is an interesting as well as important problem. Nonnegative matrix factorization (NMF) is a low ra...

Alpha-divergence-based nonnegative tensor factorization (NTF) is applied to blind multispectral image (MSI) decomposition. The matrix of spectral profiles and the matrix of spatial distributions of the materials resident in the image are identified from the factors in Tucker3 and PARAFAC models. NTF preserves local structure in the MSI that is lost as a result of vectorization of the image when...

It is known that the sparseness of the factor matrices by Nonnegative Matrix Factorization can influence the clustering performance. In order to improve the ability of the sparse representations of the NMF, we proposed the new algorithm for Nonnegatie Matrix Factorization, coined nonnegative matrix factorization on orthogonal subspace with smoothed L0 norm constrained, in which the generation o...

A well-known result from linear system theory states that the minimal inner size of a factorization of the Hankel matrix H of a system gives the minimal order of a realization. In this brief it is shown that when dealing with positive linear systems, the existence of a factorization of the Hankel matrix into two nonnegative matrices is only a necessary condition for the existence of a positive ...

We consider the problem of nonnegative tensor factorization. Our aim is to derive an efficient algorithm that is also suitable for parallel implementation. We adopt the alternating optimization (AO) framework and solve each matrix nonnegative least-squares problem via a Nesterov-type algorithm for strongly convex problems. We describe two parallel implementations of the algorithm, with and with...

A recent challenge in data analysis for science and engineering is that data are often represented in a structured way. In particular, many data mining tasks have to deal with group-structured prior information, where features or data items are organized into groups. In this paper, we develop group sparsity regularization methods for nonnegative matrix factorization (NMF). NMF is an effective d...

The recent years have witnessed a surge of interests in Nonnegative Matrix Factorization (NMF) in data mining and machine learning fields. Despite its elegant theory and empirical success, one of the limitations of NMF based algorithms is that it needs to store the whole data matrix in the entire process, which requires expensive storage and computation costs when the data set is large and high...