Sciweavers

145 search results - page 6 / 29
» On Constrained Sparse Matrix Factorization
Sort
View
CORR
2002
Springer
180views Education» more  CORR 2002»
14 years 9 months ago
Non-negative sparse coding
Abstract. Non-negative sparse coding is a method for decomposing multivariate data into non-negative sparse components. In this paper we briefly describe the motivation behind this...
Patrik O. Hoyer
ICDM
2008
IEEE
115views Data Mining» more  ICDM 2008»
15 years 4 months ago
Toward Faster Nonnegative Matrix Factorization: A New Algorithm and Comparisons
Nonnegative Matrix Factorization (NMF) is a dimension reduction method that has been widely used for various tasks including text mining, pattern analysis, clustering, and cancer ...
Jingu Kim, Haesun Park
SIAMSC
2010
142views more  SIAMSC 2010»
14 years 4 months ago
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization
In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
IPM
2006
151views more  IPM 2006»
14 years 9 months ago
Document clustering using nonnegative matrix factorization
A methodology for automatically identifying and clustering semantic features or topics in a heterogeneous text collection is presented. Textual data is encoded using a low rank no...
Farial Shahnaz, Michael W. Berry, V. Paul Pauca, R...
ECCV
2006
Springer
15 years 11 months ago
Controlling Sparseness in Non-negative Tensor Factorization
Non-negative tensor factorization (NTF) has recently been proposed as sparse and efficient image representation (Welling and Weber, Patt. Rec. Let., 2001). Until now, sparsity of t...
Matthias Heiler, Christoph Schnörr