mlsanityData to 14 Oct 2026

Adaptive Weighted Nonnegative Matrix Factorization for Robust Feature Representation

arXiv 2206.03020 ↗First posted 7 Jun 2022cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Nonnegative matrix factorization (NMF) has been widely used to dimensionality reduction in machine learning. However, the traditional NMF does not properly handle outliers, so that it is sensitive to noise. In order to improve the robustness of NMF, this paper proposes an adaptive weighted NMF, which introduces weights to emphasize the different importance of each data point, thus the algorithmic sensitivity to noisy data is decreased. It is very different from the existing robust NMFs that use a slow growth similarity measure. Specifically, two strategies are proposed to achieve this: fuzzier weighted technique and entropy weighted regularized technique, and both of them lead to an iterative solution with a simple form. Experimental results showed that new methods have more robust feature representation on several real datasets with noise than exsiting methods.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 1 of its 20 references that are in the map. First posted on arXiv 7 Jun 2022.

Builds on

1 of 20 references.

References · 1

  1. 2015Compressed Nonnegative Matrix Factorization is Fast and Accuratecited by 4

Built on by

Not cited yet.