• No results found

[PDF] Top 20 The non-negative $Q_1$-matrix completion problem

Has 10000 "The non-negative $Q_1$-matrix completion problem" found on our website. Below are the top 20 most common "The non-negative $Q_1$-matrix completion problem".

The non-negative $Q_1$-matrix completion problem

The non-negative $Q_1$-matrix completion problem

... partial matrix is a rectan- gular array of numbers in which some entries are specified while others are free to be ...partial matrix M is fully specified if all entries of M are specified, ...a ... See full document

8

Sparse Non negative Matrix Language Modeling

Sparse Non negative Matrix Language Modeling

... For the complete derivation, see Appendix B. The problem with this gradient is that we need to sum over the entire vocabulary V in the denominator. In Eq. (7) we could get away with this by precomput- ing the row ... See full document

14

The – matrix completion problem for digraphs of matrices with less than four directed lines

The – matrix completion problem for digraphs of matrices with less than four directed lines

... a matrix has rows and columns then we say it is a square ...diagonal matrix is a square matrix with all the non-diagonal elements ...a matrix are zero, we call a zero ...partial ... See full document

17

Non-Convex Matrix Completion and Related Problems via Strong Duality

Non-Convex Matrix Completion and Related Problems via Strong Duality

... the problem of weighted low- rank approximation, which can be cast in the form of (1), without some randomization in the measurements made on the underlying low rank matrix, it is NP-hard to achieve a good ... See full document

56

Piano multipitch estimation using sparse coding embedded deep learning

Piano multipitch estimation using sparse coding embedded deep learning

... estimation problem has always been the focus of acoustic music processing; however, existing algorithms perform deficiently due to its ...estimation problem by proposing MPENet based on a novel multimodal ... See full document

23

A Novel Approach for the Colour Deconvolution of Multiple Histological Stains

A Novel Approach for the Colour Deconvolution of Multiple Histological Stains

... this problem include Non Negative Matrix Factorisation (NNMF) [3] which estimates both the source staining colours and separates pixels into their constituent ... See full document

7

The non-negative matrix factorization toolbox for biological data mining

The non-negative matrix factorization toolbox for biological data mining

... (sparse) non-negative linear combination of the basis ...a non-convex optimization problem, and thus, block-coordinate descent is the main prescribed optimiza- tion technique for such ...are ... See full document

15

Multimodal voice conversion based on non-negative matrix factorization

Multimodal voice conversion based on non-negative matrix factorization

... Statistical approaches to VC are the most widely stud- ied [6, 18, 19]. Among these approaches, a GMM-based mapping approach [6] is the most common. In this approach, the conversion function is interpreted as the ... See full document

9

Collective Matrix Completion

Collective Matrix Completion

... the problem of recovering a low-rank matrix when the data are collected from multiple and heterogeneous source ...the matrix entries are sampled from an exponential family ...collective ... See full document

43

ONLINE NON-NEGATIVE MATRIX FACTORIZATION FOR CLUSTERING OF NEWS DOCUMENT

ONLINE NON-NEGATIVE MATRIX FACTORIZATION FOR CLUSTERING OF NEWS DOCUMENT

... nonnegative matrix factorization of ...above problem as the function is non-convex in terms of W and ...any non negative invertible matrix D4 ... See full document

13

Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy

Graph Regularized Non-negative Matrix Factorization By Maximizing Correntropy

... this problem. One way is to use nonlinear distance mea- sure, such as correntropy [29], [30], kernelized distance [28], etc. Another approach is preserving the geometric structure of data based on the manifold ... See full document

10

Matrix Completion with Noisy Entries and Outliers

Matrix Completion with Noisy Entries and Outliers

... robust matrix completion method that can be applied to recover a matrix with missing, noisy and/or outlying ...the matrix into a sum of a low rank and a sparse matrix, the new approach ... See full document

25

On Lower and Upper Bounds of Matrices

On Lower and Upper Bounds of Matrices

... the problem of finding lower bounds of non-negative weighted mean matrices acting on non-increasing non- negative sequences in l p when p ≥ 1 has been studied in [5] and ...mean ... See full document

18

Transcribing Bach chorales: Limitations and potentials of non-negative matrix factorisation

Transcribing Bach chorales: Limitations and potentials of non-negative matrix factorisation

... [11]; and the blackboard architecture [2,21]. A knowl- edge-based approach exploits relevant knowledge in terms of rules to assist decision-making process. For example, the blackboard architecture [21] houses thir- teen ... See full document

13

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

Iterative Weighted Non-smooth Non-negative Matrix Factorization for Face Recognition

... diagonal non-negative matrix factorization (BDNMF) for color face representation and ...diagonal matrix with the aim of interpreting color information of various ...and ... See full document

10

Feature enhancement of reverberant speech by distribution matching and non-negative matrix factorization

Feature enhancement of reverberant speech by distribution matching and non-negative matrix factorization

... the non- reverberant target ...the non-reverberant distribution, a complex multivariate mapping would be ...the problem can be simplified by applying a decorrelating linear transforma- tion to the ... See full document

14

Low Permutation-rank Matrices: Structural Properties and Noisy Completion

Low Permutation-rank Matrices: Structural Properties and Noisy Completion

... have non-negative ...any matrix M c (1) , M c (2) , ...be non-zero in exactly one of these diagonal ...the matrix M will induce the proposed algorithm to output a decomposition of ... See full document

43

A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion

... 1-bit matrix completion under the uniform sampling model, where observed entries are assumed to be sampled randomly and ...Netflix problem, for instance, the uniform sampling model is equivalent to ... See full document

29

Matrix Completion from  Noisy Entries

Matrix Completion from Noisy Entries

... n matrix M. It has recently been discovered that, if the matrix M has rank r, and unless it is too ‘structured’, a small random subset of its entries allow to reconstruct it ...optimization problem ... See full document

22

Distributed Matrix Completion and Robust Factorization

Distributed Matrix Completion and Robust Factorization

... algorithms—the matrix factorization algorithms underlying a wide variety of prac- tical applications, including collaborative filtering for recommender systems , ...general matrix factorization ... See full document

48

Show all 10000 documents...