Convex nonnegative matrix factorization with missing data

Abstract : Convex nonnegative matrix factorization (CNMF) is a variant of nonnegative matrix factorization (NMF) in which the components are a convex combination of atoms of a known dictionary. In this contribution, we propose to extend CNMF to the case where the data matrix and the dictionary have missing entries. After a formulation of the problem in this context of missing data, we propose a majorization-minimization algorithm for the solving of the optimization problem incurred. Experimental results with synthetic data and audio spectrograms highlight an improvement of the performance of reconstruction with respect to standard NMF. The performance gap is particularly significant when the task of reconstruction becomes arduous, e.g. when the ratio of missing data is high, the noise is steep, or the complexity of data is high.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-01346492
Contributor : Valentin Emiya <>
Submitted on : Friday, October 7, 2016 - 12:05:56 PM
Last modification on : Monday, April 29, 2019 - 5:03:39 PM
Long-term archiving on : Sunday, January 8, 2017 - 12:13:10 PM

File

mlsp2016.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01346492, version 1

Citation

Ronan Hamon, Valentin Emiya, Cédric Févotte. Convex nonnegative matrix factorization with missing data. IEEE International Workshop on Machine Learning for Signal Processing, Sep 2016, Vietri sul Mare, Salerno, Italy. ⟨hal-01346492⟩

Share

Metrics

Record views

575

Files downloads

752