2000 character limit reached
An Online Expectation-Maximisation Algorithm for Nonnegative Matrix Factorisation Models
Published 11 Jan 2014 in cs.LG, stat.CO, and stat.ML | (1401.2490v1)
Abstract: In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters. We also propose a sequential Monte Carlo approximation of our online EM algorithm. We show the performance of the proposed method with two numerical examples.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.