108 search results - page 5 / 22 » Clustering with Bregman Divergences |
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
TIT
2010
13 years 2 months ago
2010
Belief propagation is shown to be an instance of a hybrid between two projection algorithms in the convex programming literature: Dykstra's algorithm with cyclic Bregman proje...
PAMI
2006
13 years 7 months ago
2006
Recent papers and patents in iterative unsupervised learning have emphasized a new trend in clustering. It basically consists of penalizing solutions via weights on the instance po...
PKDD
2009
Springer
14 years 2 days ago
2009
Springer
ALT
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...