Talk by Nicolas Gillis (University of Mons)
Автор: ENLA Seminar
Загружено: 2021-01-27
Просмотров: 2550
Given a nonnegative matrix X and a factorization rank r, nonnegative matrix factorization (NMF) approximates the matrix X as the product of a nonnegative matrix W with r columns and a nonnegative matrix H with r rows. NMF has become a standard linear dimensionality reduction technique in data mining and machine learning. In this talk, we address the issue of non-uniqueness of NMF decompositions, also known as the identifiability issue, which is crucial in many applications. We discuss three key NMF models that allow us to obtain unique NMFs, namely, separable NMF, minimum-volume NMF, and sparse NMF. We also discuss how the factors (W,H) in such models can be computed. We illustrate these results on facial feature extraction, blind hyperspectral unmixing, and topic modeling.
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
![Dimensionality Reduction for Matrix- and Tensor-Coded Data [Part 1]](https://ricktube.ru/thumbnail/hmmnRF66hOA/mqdefault.jpg)
