Results 21 to 30 of about 82,948 (222)
Coseparable Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a popular model in the field of pattern recognition. It aims to find a low rank approximation for nonnegative data M by a product of two nonnegative matrices W and H. In general, NMF is NP-hard to solve while it can be solved efficiently under separability assumption, which requires the columns of factor matrix
Junjun Pan, Michael K. Ng
openaire +3 more sources
Contrastive Deep Nonnegative Matrix Factorization For Community Detection [PDF]
Recently, nonnegative matrix factorization (NMF) has been widely adopted for community detection, because of its better interpretability. However, the existing NMF-based methods have the following three problems: 1) they directly transform the original ...
Yuecheng Li +4 more
semanticscholar +1 more source
Robust Structured Convex Nonnegative Matrix Factorization for Data Representation
Nonnegative Matrix Factorization (NMF) is a popular technique for machine learning. Its power is that it can decompose a nonnegative matrix into two nonnegative factors whose product well approximates the nonnegative matrix.
Qing Yang +3 more
doaj +1 more source
Hyperspectral Unmixing Based on Nonnegative Matrix Factorization: A Comprehensive Review [PDF]
Hyperspectral unmixing has been an important technique that estimates a set of endmembers and their corresponding abundances from a hyperspectral image (HSI).
Xin-Ru Feng +5 more
semanticscholar +1 more source
Adversarially-Trained Nonnegative Matrix Factorization [PDF]
We consider an adversarially-trained version of the nonnegative matrix factorization, a popular latent dimensionality reduction technique. In our formulation, an attacker adds an arbitrary matrix of bounded norm to the given data matrix. We design efficient algorithms inspired by adversarial training to optimize for dictionary and coefficient matrices ...
Cai, Ting +2 more
openaire +4 more sources
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
Image Clustering Algorithm Based on Hypergraph Regularized Nonnegative Tucker Decomposition [PDF]
The internal geometry structure of high-dimensional data is ignored when nonnegative tensor decomposition is applied to image clustering.To solve this problem, we propose a Hypergraph regularized Nonnegative Tucker Decomposition(HGNTD) model by adding a ...
CHEN Luyao, LIU Qilong, XU Yunxia, CHEN Zhen
doaj +1 more source
Cauchy nonnegative matrix factorization [PDF]
Nonnegative matrix factorization (NMF) is an effective and popular low-rank model for nonnegative data. It enjoys a rich background, both from an optimization and probabilistic signal processing viewpoint. In this study, we propose a new cost-function for NMF fitting, which is introduced as arising naturally when adopting a Cauchy process model for ...
Liutkus, Antoine +2 more
openaire +2 more sources
Co-sparse Non-negative Matrix Factorization
Non-negative matrix factorization, which decomposes the input non-negative matrix into product of two non-negative matrices, has been widely used in the neuroimaging field due to its flexible interpretability with non-negativity property.
Fan Wu +3 more
doaj +1 more source
Weighted Nonnegative Matrix Factorization for Image Inpainting and Clustering
Conventional nonnegative matrix factorization and its variants cannot separate the noise data space into a clean space and learn an effective low-dimensional subspace from Salt and Pepper noise or Contiguous Occlusion.
Xiangguang Dai +3 more
doaj +1 more source

