7015 search results - page 2 / 1403 » Approximation algorithms for co-clustering |
PKDD
2009
Springer
14 years 3 days ago
2009
Springer
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
ICPR
2004
IEEE
14 years 6 months ago
2004
IEEE
The visual appearance of an image is closely associated with its low-level features. Identifying the set of features that best characterizes the image is useful for tasks such as ...
ICMCS
2005
IEEE
13 years 11 months ago
2005
IEEE
This paper presents techniques in clustering the sametopic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the ...
SIGECOM
2011
ACM
12 years 8 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...