analiza aiqbench
This study provides a rigorous benchmark of the `nnmf` R package against existing tools using real-world datasets rather than simulations, offering critical insights into computational efficiency and convergence stability for practitioners. By evaluating reconstruction accuracy under complex noise conditions, it delivers actionable guidance for selecting dimensionality reduction algorithms in practical machine learning workflows. The focus remains squarely on optimizing core ML techniques like non-negative matrix factorization within a standard software ecosystem.
Non--negative matrix factorization using the \textit{R} package \textsf{nnmf}
arXiv:2607.20084v1 Announce Type: cross Abstract: Non--negative matrix factorization (NMF) has become an established dimensionality reduction technique for extracting latent structures from non--negative data and has found widespread applications in fields such as bioinformatics, text mining, image analysis, and recommender systems. As the popularity of NMF has increased, numerous \textit{R} packages implementing different optimization strategies and computational frameworks have been developed. Despite their widespread availability, comprehensive evaluations of these implementations under real--world data conditions remain limited. Consequently, researchers often lack objective guidance when selecting an appropriate package for practical applications. This study introduces a new \textit{R} package for NMF and offers asystematic performance comparison with two widely available \textit{R} packages for NMF analysis. Rather than relying on simulated datasets, the evaluation is conducted using real--world data to better reflect the complexity, heterogeneity, and noise characteristics encountered in practical analytical settings. The packages are assessed using a consistent experimental framework, with emphasis on computational efficiency, convergence behavior, reconstruction accuracy, memory utilization, and the stability of the resulting matrix factorization.
Abstract:Non--negative matrix factorization (NMF) has become an established dimensionality reduction technique for extracting latent structures from non--negative data and has found widespread applications in fields such as bioinformatics, text mining, image analysis, and recommender systems. As the popularity of NMF has increased, numerous \textit{R} packages implementing different optimization strategies and computational frameworks have been developed. Despite their widespread availability, comprehensive evaluations of these implementations under real--world data conditions remain limited. Consequently, researchers often lack objective guidance when selecting an appropriate package for practical applications. This study introduces a new \textit{R} package for NMF and offers asystematic performance comparison with two widely available \textit{R} packages for NMF analysis. Rather than relying on simulated datasets, the evaluation is conducted using real--world data to better reflect the complexity, heterogeneity, and noise characteristics encountered in practical analytical settings. The packages are assessed using a consistent experimental framework, with emphasis on computational efficiency, convergence behavior, reconstruction accuracy, memory utilization, and the stability of the resulting matrix factorization.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2607.20084 [stat.ML]
(or arXiv:2607.20084v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2607.20084 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 259 cuvinte
Subiecte conexe
Subzero matrix completion for sparse data analysis: large-scale learning of latent low-rank structure
arXiv · 25 aug. 2026

NVIDIA speeds up financial clustering with GPU factorization
Quantum Zeitgeist · 5 sept. 2026
Understanding Undesirable Word Embedding Associations
arXiv · 19 aug. 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · 15 aug. 2026