Matrix Factorization Techniques in Machine Learning, Signal Processing, and Statistics
Mathematics · 12.06.2023 · 11 (12) · 2674
DOI: 10.3390/math11122674 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics, online erschienen am 12.06.2023. Verfasst von Ke-Lin Du und 3 weiteren Autor:innen. Die Arbeit wurde bisher 29-mal zitiert (Crossref) und nennt 426 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: General Research Fund of the Hong Kong Research Grants Council, NSERC of Canada.
Abstract (Originalsprache)
Compressed sensing is an alternative to Shannon/Nyquist sampling for acquiring sparse or compressible signals. Sparse coding represents a signal as a sparse linear combination of atoms, which are elementary signals derived from a predefined dictionary. Compressed sensing, sparse approximation, and dictionary learning are topics similar to sparse coding. Matrix completion is the process of recovering a data matrix from a subset of its entries, and it extends the principles of compressed sensing and sparse approximation. The nonnegative matrix factorization is a low-rank matrix factorization technique for nonnegative data. All of these low-rank matrix factorization techniques are unsupervised learning techniques, and can be used for data analysis tasks, such as dimension reduction, feature extraction, blind source separation, data compression, and knowledge discovery. In this paper, we survey a few emerging matrix factorization techniques that are receiving wide attention in machine learning, signal processing, and statistics. The treated topics are compressed sensing, dictionary learning, sparse representation, matrix completion and matrix recovery, nonnegative matrix factorization, the Nyström method, and CUR matrix decomposition in the machine learning framework. Some related topics, such as matrix factorization using metaheuristics or neurodynamics, are also introduced. A few topics are suggested for future investigation in this article.
Förderung
- General Research Fund of the Hong Kong Research Grants Council
- NSERC of Canada
Zitieren
APA
Du, K., Swamy, M. N. S., Wang, Z., & Mow, W. H. (2023). Matrix Factorization Techniques in Machine Learning, Signal Processing, and Statistics. Mathematics, 11(12), 2674. https://doi.org/10.3390/math11122674
Vancouver
Du K, Swamy MNS, Wang Z, Mow WH. Matrix Factorization Techniques in Machine Learning, Signal Processing, and Statistics. Mathematics. 2023;11(12):2674. doi:10.3390/math11122674
BibTeX
@article{Du2023,
author = {Du, Ke-Lin and Swamy, M. N. S. and Wang, Zhang-Quan and Mow, Wai Ho},
title = {Matrix Factorization Techniques in Machine Learning, Signal Processing, and Statistics},
journal = {Mathematics},
year = {2023},
volume = {11},
number = {12},
pages = {2674},
doi = {10.3390/math11122674}
}
EUVIMED