61 search results - page 10 / 13 » Incremental clustering via nonnegative matrix factorization |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Mining discrete patterns in binary data is important for subsampling, compression, and clustering. We consider rankone binary matrix approximations that identify the dominant patt...
CVPR
2001
IEEE
14 years 9 months ago
2001
IEEE
This paper describes a face detection approach via learning local features. The key idea is that local features, being manifested by a collection of pixels in a local region, are ...
COLING
2008
13 years 9 months ago
2008
In this paper, an extension of a dimensionality reduction algorithm called NONNEGATIVE MATRIX FACTORIZATION is presented that combines both `bag of words' data and syntactic ...
ALT
2008
Springer
14 years 4 months ago
2008
Springer
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...