In this paper, we propose to cluster and model network-level traffic states based on a geometrical weighted similarity measure of network-level traffic states and locality preservative non-negative matrix factorization. The geometrical weighted similarity measure makes use of correlation between neighboring roads to describe spatial configurations of global traffic patterns. Based on it, we pro...

When analyzing patterns, our goals are (i) to find structure in the presence of noise, (ii) to decompose the observed structure into sub-components, and (iii) to use the components for pattern completion. Here, a novel loop architecture is introduced to perform these tasks in an unsupervised manner. The architecture combines sparse code shrinkage with non-negative matrix factorization and blend...

Inference of individual admixture coefficients, which is important for population genetic and association studies, is commonly performed using compute-intensive likelihood algorithms. With the availability of large population genomic data sets, fast versions of likelihood algorithms have attracted considerable attention. Reducing the computational burden of estimation algorithms remains, howeve...

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 . A longstanding open question, posed by Cohen and Rothblum in 1993, is whether a rational matrix M always has an NMF of minimal inner dimension d whose factors W and H are also rational. We answer this question negat...

We use a multiscale approach to reduce the time to produce the nonnegative matrix factorization (NMF) of a matrix A, that is, A ≈ WH. We also investigate QR factorization as a method for initializing W during the iterative process for producing the nonnegative matrix factorization of A. Finally, we use our approach to produce nonnegative matrix factorizations for classifying images and compare ...