activity
20082026
most citedFast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization

269 citations · 3k across the 82 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

math.OC2014★ 39 cited

Heuristics for Exact Nonnegative Matrix Factorization

Arnaud Vandaele, Nicolas Gillis, François Glineur +1

The exact nonnegative matrix factorization (exact NMF) problem is the following: given an -by- nonnegative matrix and a factorization rank , find, if possible, an -…

math.NA2014

Proceedings of the second "international Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST'14)

L. Jacques, C. De Vleeschouwer, Y. Boursier +64

The implicit objective of the biennial "international - Traveling Workshop on Interactions between Sparse models and Technology" (iTWIST) is to foster collaboration between interna…

math.NA2014★ 36 cited

Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization

Nicolas Gillis, Abhishek Kumar

Given a matrix (not necessarily nonnegative) and a factorization rank , semi-nonnegative matrix factorization (semi-NMF) looks for a matrix with columns and a nonneg…

stat.ML2014★ 10 cited

Enhancing Pure-Pixel Identification Performance via Preconditioning

Nicolas Gillis, Wing-Kin Ma

In this paper, we analyze different preconditionings designed to enhance robustness of pure-pixel search algorithms, which are used for blind hyperspectral unmixing and which are e…

stat.ML2014★ 266 cited

The Why and How of Nonnegative Matrix Factorization

Nicolas Gillis

Nonnegative matrix factorization (NMF) has become a widely used tool for the analysis of high-dimensional data as it automatically extracts sparse and meaningful features from a se…