7015 search results - page 5 / 1403 » Approximation algorithms for co-clustering |
ICALP
2011
Springer
14 years 27 days ago
2011
Springer
118
click to vote
JMLR
2010
14 years 4 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
All Netflix Prize algorithms proposed so far are prohibitively costly for large-scale production systems. In this paper, we describe an efficient dataflow implementation of a coll...
190
Voted
SDM
2011
SIAM
14 years 8 days ago
2011
SIAM
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
ALGORITHMICA
2011
14 years 1 months ago
2011
