Sciweavers

611 search results - page 16 / 123
» The Cardinality Matrix Constraint
Sort
View
SAC
2009
ACM
15 years 4 months ago
The sum-of-increments constraint in the consecutive-ones matrix decomposition problem
The combinatorial problem of decomposing an integer matrix into a small positive linear combination of binary matrices that have the consecutive-ones property arises in cancer rad...
Sebastian Brand
83
Voted
MP
2011
14 years 15 days ago
Implicit solution function of P0 and Z matrix linear complementarity constraints
Abstract. Using the least element solution of the P0 and Z matrix linear complementarity problem (LCP), we define an implicit solution function for linear complementarity constrai...
Xiaojun Chen, Shuhuang Xiang
WEBI
2007
Springer
15 years 3 months ago
Pairwise Constraints-Guided Non-negative Matrix Factorization for Document Clustering
Nonnegative Matrix Factorization (NMF) has been proven to be effective in text mining. However, since NMF is a well-known unsupervised components analysis technique, the existing ...
Yujiu Yang, Bao-Gang Hu
IJON
2008
116views more  IJON 2008»
14 years 9 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
CORR
2004
Springer
152views Education» more  CORR 2004»
14 years 9 months ago
Non-negative matrix factorization with sparseness constraints
Non-negative matrix factorization (NMF) is a recently developed technique for finding parts-based, linear representations of non-negative data. Although it has successfully been a...
Patrik O. Hoyer