474 search results - page 11 / 95 » Approximation Algorithms for Tensor Clustering |
SODA
2001
ACM
13 years 9 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
PAKDD
2009
ACM
14 years 5 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
ESA
2011
Springer
12 years 7 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
PSIVT
2009
Springer
14 years 12 days ago
2009
Springer
This article provides a simple and general way for defining the recovery rate of clustering algorithms using a given family of old clusters for evaluating the performance of the a...
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper, we study probabilistic modeling of heterogeneously attributed multi-dimensional arrays. The model can manage the heterogeneity by employing an individual exponential...