Approximation Algorithms for Bregman Co-clustering and Tensor Clustering

@article{Jegelka2008ApproximationAF,
  title={Approximation Algorithms for Bregman Co-clustering and Tensor Clustering},
  author={Stefanie Jegelka and Suvrit Sra and Arindam Banerjee},
  journal={CoRR},
  year={2008},
  volume={abs/0812.0389}
}
In the past few years powerful generalizations to the Euclidean k-means problem have been made, such as Bregman clustering [7], co-clustering (i.e., simultaneous clustering of rows and columns of an input matrix) [9, 18], and tensor clustering [8, 34]. Like k-means, these more general problems also suffer from the NP-hardness of the associated optimization… CONTINUE READING