Solving NMF with smoothness and sparsity constraints using PALM

10/31/2019
by   Raimon Fabregat, et al.
0

Non-negative matrix factorization is a problem of dimensionality reduction and source separation of data that has been widely used in many fields since it was studied in depth in 1999 by Lee and Seung, including in compression of data, document clustering, processing of audio spectrograms and astronomy. In this work we have adapted a minimization scheme for convex functions with non-differentiable constraints called PALM to solve the NMF problem with solutions that can be smooth and/or sparse, two properties frequently desired.

READ FULL TEXT

page 6

page 7

research
07/29/2014

NMF with Sparse Regularizations in Transformed Domains

Non-negative blind source separation (non-negative BSS), which is also r...
research
02/04/2011

A convex model for non-negative matrix factorization and dimensionality reduction on physical space

A collaborative convex framework for factoring a data matrix X into a no...
research
02/05/2019

Minimum description length as an objective function for non-negative matrix factorization

Non-negative matrix factorization (NMF) is a dimensionality reduction te...
research
06/03/2019

Clustering by Orthogonal NMF Model and Non-Convex Penalty Optimization

The non-negative matrix factorization (NMF) model with an additional ort...
research
12/08/2020

Sparse encoding for more-interpretable feature-selecting representations in probabilistic matrix factorization

Dimensionality reduction methods for count data are critical to a wide r...
research
09/07/2020

Improving Problem Identification via Automated Log Clustering using Dimensionality Reduction

Goal: We consider the problem of automatically grouping logs of runs tha...

Please sign up or login with your details

Forgot password? Click here to reset