Learning latent features with infinite non-negative binary matrix tri-factorization

Citation

Yang X, Huang K, Zhang R & Hussain A (2016) Learning latent features with infinite non-negative binary matrix tri-factorization. In: Hirose A, Ozawa S, Doya K, Ikeda K, Lee M & Liu D (eds.) Neural Information Processing: 23rd International Conference, ICONIP 2016, Kyoto, Japan, October 16–21, 2016, Proceedings, Part I. Lecture Notes in Computer Science, 9947. ICONIP 2016: 23rd International Conference on Neural Information Processing, Kyoto, Japan, 16.10.2016-21.10.2016. Cham, Switzerland: Springer, pp. 587-596. https://doi.org/10.1007/978-3-319-46687-3_65

Abstract
Non-negative Matrix Factorization (NMF) has been widely exploited to learn latent features from data. However, previous NMF models often assume a fixed number of features, saypfeatures, wherepis simply searched by experiments. Moreover, it is even difficult to learn binary features, since binary matrix involves more challenging optimization problems. In this paper, we propose a new Bayesian model called infinite non-negative binary matrix tri-factorizations model (iNBMT), capable of learning automatically the latent binary features as well as feature number based on Indian Buffet Process (IBP). Moreover, iNBMT engages a tri-factorization process that decomposes a nonnegative matrix into the product of three components including two binary matrices and a non-negative real matrix. Compared with traditional bi-factorization, the tri-factorization can better reveal the latent structures among items (samples) and attributes (features). Specifically, we impose an IBP prior on the two infinite binary matrices while a truncated Gaussian distribution is assumed on the weight matrix. To optimize the model, we develop an efficient modified maximization-expectation algorithm (ME-algorithm), with the iteration complexity one order lower than another recently-proposed Maximization-Expectation-IBP model[9]. We present the model definition, detail the optimization, and finally conduct a series of experiments. Experimental results demonstrate that our proposed iNBMT model significantly outperforms the other comparison algorithms in both synthetic and real data.

Keywords
Infinite non-negative binary matrix tri-factorization; Infinite latent feature model; Indian Buffet Process prior