Split gradient method for informed non-negative matrix factorization

5Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recently, some informed Non-negative Matrix Factorization (NMF) methods were introduced in which some a priori knowledge (i.e., expert’s knowledge) were taken into account in order to improve the separation process. This knowledge was expressed as known components of one factor, namely the profile matrix. Also, the sum-to-one property of the profile matrix was taken into account by an appropriate sequential normalization. However, our previous approach was unable to check both constraints at the same time. In this work, a new parametrization is proposed which takes into consideration both constraints simultaneously by incorporating a new unconstrained matrix. From this parameterization, new updates rules are introduced which are based on the framework of the Split Gradient Method by Lantéri et al. The cost function is defined in terms of a weighted Frobenius norm and the developed rules involve a new shift in order to ensure the non-negativity property. Simulations on a noisy source apportionment problem show the relevance of the proposed method.

Cite

CITATION STYLE

APA

Chreiky, R., Delmaire, G., Puigt, M., Roussel, G., Courcot, D., & Abche, A. (2015). Split gradient method for informed non-negative matrix factorization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9237, pp. 376–383). Springer Verlag. https://doi.org/10.1007/978-3-319-22482-4_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free