A Neural Network for Determination of Latent Dimensionality in Nonnegative Matrix Factorization
Benjamin T. Nebgen, Raviteja Vangara, Miguel A. Hombrados-Herrera,, Svetlana Kuksova, Boian S. Alexandrov

TL;DR
This paper introduces a neural network-based approach to automatically determine the optimal number of latent features in Non-negative Matrix Factorization, improving accuracy and efficiency over existing methods.
Contribution
The paper presents a novel combination of NMFk and a Multi-Layer Perceptron classifier to accurately and automatically identify the latent dimensionality in NMF without prior knowledge.
Findings
Achieves over 95% success rate on test data
Correctly identifies number of features in benchmark datasets
Outperforms ARD, AIC, and Stability-based methods
Abstract
Non-negative Matrix Factorization (NMF) has proven to be a powerful unsupervised learning method for uncovering hidden features in complex and noisy data sets with applications in data mining, text recognition, dimension reduction, face recognition, anomaly detection, blind source separation, and many other fields. An important input for NMF is the latent dimensionality of the data, that is, the number of hidden features, K, present in the explored data set. Unfortunately, this quantity is rarely known a priori. We utilize a supervised machine learning approach in combination with a recent method for model determination, called NMFk, to determine the number of hidden features automatically. NMFk performs a set of NMF simulations on an ensemble of matrices, obtained by bootstrapping the initial data set, and determines which K produces stable groups of latent features that reconstruct…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
