# Approximation Algorithms for Bregman Co-clustering and Tensor Clustering

@article{Jegelka2008ApproximationAF, title={Approximation Algorithms for Bregman Co-clustering and Tensor Clustering}, author={S. Jegelka and S. Sra and A. Banerjee}, journal={ArXiv}, 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. Researchers have developed approximation algorithms of varying degrees of sophistication for k-means, k-medians, and more recently also for… CONTINUE READING

5 Citations

Approximation Algorithms for Clustering via Weighted Impurity Measures

- Computer Science, Mathematics
- 2018

5

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 45 REFERENCES

Thl versus Th 2 responses in AIDS . Curr . Thl and Th 2 responses . Immunol . Tudaq

- 1994

Human interleukin-19 and its receptor: a potential role in the induction of Th2 responses.

- Medicine, Biology
- 2004

118

Segmentation of vessel-like patterns using mathematical morphology and curvature evaluation

- Computer Science, Medicine
- 2001

815