Continuous Semi-Supervised Nonnegative Matrix Factorization
Nonnegative matrix factorization can be used to automatically detect topics within a corpus in an unsupervised fashion. The technique amounts to an approximation of a nonnegative matrix as the product of two nonnegative matrices of lower rank. In certain
Michael R. Lindstrom +4 more
doaj +1 more source
Nonnegative Inverse Elementary Divisors Problem for Lists with Nonnegative Real Parts
In this paper, sufficient conditions for the existence and construction of nonnegative matrices with prescribed elementary divisors for a list of complex numbers with nonnegative real part are obtained, and the corresponding nonnegative matrices are ...
Hans Nina +3 more
doaj +1 more source
Uncovering community structures with initialized Bayesian nonnegative matrix factorization. [PDF]
Uncovering community structures is important for understanding networks. Currently, several nonnegative matrix factorization algorithms have been proposed for discovering community structure in complex networks.
Xianchao Tang +3 more
doaj +1 more source
A Symmetric Rank-one Quasi Newton Method for Non-negative Matrix Factorization [PDF]
As we all known, the nonnegative matrix factorization (NMF) is a dimension reduction method that has been widely used in image processing, text compressing and signal processing etc.
Lai, Shu-Zhen +2 more
core +3 more sources
Multi-Component Nonnegative Matrix Factorization [PDF]
Real data are usually complex and contain various components. For example, face images have expressions and genders. Each component mainly reflects one aspect of data and provides information others do not have. Therefore, exploring the semantic information of multiple components as well as the diversity among them is of great benefit to understand ...
Wang, Jing +8 more
openaire +2 more sources
Nonnegative Matrix Factorizations Performing Object Detection and Localization
We study the problem of detecting and localizing objects in still, gray-scale images making use of the part-based representation provided by nonnegative matrix factorizations.
G. Casalino, N. Del Buono, M. Minervini
doaj +1 more source
Matrix Factorization Techniques in Machine Learning, Signal Processing, and Statistics
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 ...
Ke-Lin Du +3 more
doaj +1 more source
Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices [PDF]
Although nonnegative matrix factorization (NMF) is NP-hard in general, it has been shown very recently that it is tractable under the assumption that the input nonnegative data matrix is close to being separable (separability requires that all columns of
Gillis, Nicolas
core +1 more source
Monotonous (semi-)nonnegative matrix factorization [PDF]
Nonnegative matrix factorization (NMF) factorizes a non-negative matrix into product of two non-negative matrices, namely a signal matrix and a mixing matrix. NMF suffers from the scale and ordering ambiguities. Often, the source signals can be monotonous in nature.
Bhatt, Nirav, Ayyar, Arun
openaire +2 more sources
Toeplitz nonnegative realization of spectra via companion matrices
The nonnegative inverse eigenvalue problem (NIEP) is the problem of finding conditions for the existence of an n × n entrywise nonnegative matrix A with prescribed spectrum Λ = {λ1, . . ., λn}.
Collao Macarena +2 more
doaj +1 more source

