Automatic Relevance Determination in Nonnegative Matrix Factorization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Automatic Relevance Determination in Nonnegative Matrix Factorization

Abstract

Nonnegative matrix factorization (NMF) has become a popular technique for data analysis and dimensionality reduction. However, it is often assumed that the number of latent dimensions (or components) is given. In practice, one must choose a suitable value depending on the data and/or setting. In this paper, we address this important issue by using a Bayesian approach to estimate the latent dimensionality, or equivalently, select the model order. This is achieved via automatic relevance determination (ARD), a technique that has been employed in Bayesian PCA and sparse Bayesian learning. We show via experiments on synthetic data that our technique is able to recover the correct number of components, while it is also able to recover an effective number of components from real datasets such as the MIT CBCL datase
Fichier principal
Vignette du fichier
17.pdf (152.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00369376 , version 1 (19-03-2009)

Identifiers

  • HAL Id : inria-00369376 , version 1

Cite

Vincent Y. F. Tan, Cédric Févotte. Automatic Relevance Determination in Nonnegative Matrix Factorization. SPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, United Kingdom. ⟨inria-00369376⟩
539 View
3825 Download

Share

Gmail Facebook X LinkedIn More