Results 71 to 80 of about 4,031 (246)
Sparsity-Constrained Coupled Nonnegative Matrix–Tensor Factorization for Hyperspectral Unmixing
Hyperspectral unmixing refers to a source separation problem of decomposing a hyperspectral imagery (HSI) to estimate endmembers, and their corresponding abundances.
Heng-Chao Li +3 more
doaj +1 more source
Link prediction based on non-negative matrix factorization. [PDF]
With the rapid expansion of internet, the complex networks has become high-dimensional, sparse and redundant. Besides, the problem of link prediction in such networks has also obatined increasingly attention from different types of domains like ...
Bolun Chen +4 more
doaj +1 more source
Max–min distance nonnegative matrix factorization
Nonnegative Matrix Factorization (NMF) has been a popular representation method for pattern classification problems. It tries to decompose a nonnegative matrix of data samples as the product of a nonnegative basis matrix and a nonnegative coefficient matrix. The columns of the coefficient matrix can be used as new representations of these data samples.
Wang, Jim Jing-Yan, Gao, Xin
openaire +3 more sources
Abstract We develop a delay‐aware estimation and control framework for a non‐isothermal axial dispersion tubular reactor modelled as a coupled parabolic‐hyperbolic PDE system with recycle‐induced state delay. The infinite‐dimensional dynamics are preserved without spatial discretization by representing the delay as a transport PDE and adopting a late ...
Behrad Moadeli, Stevan Dubljevic
wiley +1 more source
Neighborhood Preserving Convex Nonnegative Matrix Factorization [PDF]
The convex nonnegative matrix factorization (CNMF) is a variation of nonnegative matrix factorization (NMF) in which each cluster is expressed by a linear combination of the data points and each data point is represented by a linear combination of the cluster centers.
Wei, Jiang, Min, Li, Zhang, Yongqing
openaire +2 more sources
Restricted Tweedie stochastic block models
Abstract The stochastic block model (SBM) is a widely used framework for community detection in networks, where the network structure is typically represented by an adjacency matrix. However, conventional SBMs are not directly applicable to an adjacency matrix that consists of nonnegative zero‐inflated continuous edge weights.
Jie Jian, Mu Zhu, Peijun Sang
wiley +1 more source
Stretched non-negative matrix factorization
A novel algorithm, stretchedNMF, is introduced for non-negative matrix factorization (NMF), accounting for signal stretching along the independent variable’s axis.
Ran Gu +11 more
doaj +1 more source
Robust semi-supervised nonnegative matrix factorization [PDF]
Nonnegative matrix factorization (NMF), which aims at finding parts-based representations of nonnegative data, has been widely applied to a wide range of applications such as data clustering, pattern recognition and computer vision. Real-world data are often sparse and noisy which may reduce the accuracy of representations. And a small part of data may
Wang, Jing +3 more
openaire +2 more sources
The Huang–Yang Formula for the Low‐Density Fermi Gas: Upper Bound
ABSTRACT We study the ground state energy of a gas of spin 1/2$1/2$ fermions with repulsive short‐range interactions. We derive an upper bound that agrees, at low density ϱ$\varrho$, with the Huang–Yang conjecture. The latter captures the first three terms in an asymptotic low‐density expansion, and in particular the Huang–Yang correction term of order
Emanuela L. Giacomelli +3 more
wiley +1 more source
Context aware nonnegative matrix factorization clustering [PDF]
6 pages, 3 figures.
TRIPODI, ROCCO +2 more
openaire +3 more sources

