Results 31 to 40 of about 24,084 (265)
On Rationality of Nonnegative Matrix Factorization [PDF]
Nonnegative matrix factorization (NMF) is the problem of decomposing a given nonnegative n × m matrix M into a product of a nonnegative n × d matrix W and a nonnegative d × m matrix H. NMF has a wide variety of applications, including bioinformatics, chemometrics, communication complexity, machine learning, polyhedral combinatorics, among many others ...
Dmitry Chistikov 0001 +4 more
openaire +2 more sources
Negative Binomial Matrix Factorization [PDF]
We introduce negative binomial matrix factorization (NBMF), a matrix factorization technique specially designed for analyzing over-dispersed count data. It can be viewed as an extension of Poisson factorization (PF) perturbed by a multiplicative term which models exposure. This term brings a degree of freedom for controlling the dispersion, making NBMF
Olivier Gouvert +2 more
openaire +3 more sources
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
Background Identifying drug–target interactions (DTIs) plays a key role in drug development. Traditional wet experiments to identify DTIs are expensive and time consuming. Effective computational methods to predict DTIs are useful to narrow the searching
Junjun Zhang, Minzhu Xie
doaj +1 more source
We investigate the problem of factorizing a matrix into several sparse matrices and propose an algorithm for this under randomness and sparsity assumptions. This problem can be viewed as a simplification of the deep learning problem where finding a factorization corresponds to finding edges in different layers and values of hidden units.
Behnam Neyshabur, Rina Panigrahy
openaire +2 more sources
Matrix completion has been widely used in image recovery and recommendation. The conventional matrix completion models based on multi-layer perceptron (MLP) only has local constraints on the observation data so that the completed matrix contains a lot of
Xuan Hu, Yongming Han, Zhiqiang Geng
doaj +1 more source
Matrix Factorization as Search [PDF]
Simplex Volume Maximization (SiVM) exploits distance geometry for efficiently factorizing gigantic matrices. It was proven successful in game, social media, and plant mining. Here, we review the distance geometry approach and argue that it generally suggests to factorize gigantic matrices using search-based instead of optimization techniques.
Kristian Kersting +3 more
openaire +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
Discriminant projective non-negative matrix factorization. [PDF]
Projective non-negative matrix factorization (PNMF) projects high-dimensional non-negative examples X onto a lower-dimensional subspace spanned by a non-negative basis W and considers W(T) X as their coefficients, i.e., X≈WW(T) X.
Naiyang Guan +4 more
doaj +1 more source
Quaternion Matrix Factorization for Low-Rank Quaternion Matrix Completion
The main aim of this paper is to study quaternion matrix factorization for low-rank quaternion matrix completion and its applications in color image processing.
Jiang-Feng Chen +3 more
doaj +1 more source

