Abstract—Non Negative Matrix Factorization (NMF) has received considerable attention due to its application in pattern recognition and computer vision. However, the algorithm is sensitive to noise and assumes that the signals in the data can be linearly reconstructed. In this paper, we propose a robust non-linear probabilistic model and develop its optimization algorithm. The proposed model reduces the data to a lower dimensional manifold to get a more meaningful representation and takes into account the noisy nature of the data to improve the clustering performance of NMF. Additionally, our empirical study validates the effectiveness of the proposed method on some benchmark datasets.
Index Terms—Clustering, denoising autoencoders, dimension reduction, non-negative matrix factorization.
Satwik Bhattamishra is with Birla Institute of Technology and Science Pilani, Pilani Campus, India (e-mail: firstname.lastname@example.org).
Cite: Satwik Bhattamishra, "Deep Probabilistic NMF Using Denoising Autoencoders," International Journal of Machine Learning and Computing vol. 8, no. 1, pp. 49-53, 2018.