Analysis of the robustness of NMF algorithms

06/04/2021
by   Alex Díaz, et al.
0

We examine three non-negative matrix factorization techniques; L2-norm, L1-norm, and L2,1-norm. Our aim is to establish the performance of these different approaches, and their robustness in real-world applications such as feature selection while managing computational complexity, sensitivity to noise and more. We thoroughly examine each approach from a theoretical perspective, and examine the performance of each using a series of experiments drawing on both the ORL and YaleB datasets. We examine the Relative Reconstruction Errors (RRE), Average Accuracy and Normalized Mutual Information (NMI) as criteria under a range of simulated noise scenarios.

READ FULL TEXT

page 6

page 8

page 13

research
04/27/2021

Structured Sparse Non-negative Matrix Factorization with L20-Norm for scRNA-seq Data Analysis

Non-negative matrix factorization (NMF) is a powerful tool for dimension...
research
10/03/2012

Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization

The separability assumption (Donoho & Stodden, 2003; Arora et al., 2012)...
research
11/08/2022

Containminated Images Recovery by Implementing Non-negative Matrix Factorisation

Non-negative matrix factorisation (NMF) has been widely used to address ...
research
10/06/2012

Feature Selection via L1-Penalized Squared-Loss Mutual Information

Feature selection is a technique to screen out less important features. ...
research
07/31/2019

An L0-Norm Constrained Non-Negative Matrix Factorization Algorithm for the Simultaneous Disaggregation of Fixed and Shiftable Loads

Energy disaggregation refers to the decomposition of energy use time ser...
research
08/28/2010

On Euclidean Norm Approximations

Euclidean norm calculations arise frequently in scientific and engineeri...

Please sign up or login with your details

Forgot password? Click here to reset