نتایج جستجو برای: nonnegative irreducible matrix
تعداد نتایج: 383335 فیلتر نتایج به سال:
We consider a randomized urn model with objects of finitely many colors. The replacement matrices are random, and conditionally independent the color chosen given past. Further, conditional expectations close to an almost surely irreducible matrix. obtain sure $L^1$ convergence configuration vector, proportion vector count vector. show that first moment is sufficient for i.i.d.\ past choices. T...
In this paper, an iterative method is proposed for finding the spectral radius of irreducible nonnegative tensor based on diagonal similar tensors. The convergent tensors and has explicit linear convergence rate generalized weakly positive Some numerical results are provided to illustrate efficiency method.
Nonnegative matrix factorization NMF is a popular tool for analyzing the latent structure of nonnegative data. For a positive pairwise similarity matrix, symmetric NMF SNMF and weighted NMF WNMF can be used to cluster the data. However, both of them are not very efficient for the ill-structured pairwise similarity matrix. In this paper, a novel model, called relationship matrix nonnegative deco...
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...
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...
The Line Sum Scaling problem for a nonnegative matrix A is to find positive definite diagonal matrices Y , Z which result in prescribed row and column sums of the scaled matrix Y AZ. The Matrix Balancing problem for a nonnegative square matrix A is to find a positive definite diagonal matrix X such that the row sums in the scaled matrix XAX are equal to the corresponding column sums. We demonst...
Even though Nonnegative Matrix Factorization (NMF) in its original form performs rank reduction and signal compaction implicitly, it does not explicitly consider storage or transmission constraints. We propose a Frobenius-norm Quantized Nonnegative Matrix Factorization algorithm that is 1) almost as precise as traditional NMF for decomposition ranks of interest (with in 1-4dB), 2) admits to pra...
The relations between several necessary conditions for a square complex matrix A to be m-cyclic are examined. These conditions are known to be equivalent if A is an irreducible nonnegative matrix whose index of imprimitivity is m. In particular, we ®nd that if the digraph of A contains at least one cycle with nonzero signed length, then the following conditions are each equivalent to the m-cycl...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید