• Computer Science
  • Published 2008

Approximation Algorithms for Bregman Clustering Co-clustering and Tensor Clustering

@inproceedings{Sra2008ApproximationAF,
  title={Approximation Algorithms for Bregman Clustering Co-clustering and Tensor Clustering},
  author={Suvrit Sra and Stefanie Jegelka and Arindam Banerjee},
  year={2008}
}
The Euclidean K-means problem is fundamental to clustering and over the years it has been intensely investigated. More recently, generalizations such as Bregman k-means [8], co-clustering [10], and tensor (multi-way) clustering [40] have also gained prominence. A well-known computational difficulty encountered by these clustering problems is the NP-Hardness of the associated optimization task, and commonly used methods guarantee at most local optimality. Consequently, approximation algorithms… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-9 OF 9 CITATIONS

Small-Variance Asymptotics for Bayesian Models

VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Approximation Algorithms for Bregman Co-clustering and Tensor Clustering

VIEW 9 EXCERPTS
CITES BACKGROUND & METHODS

Hardness and Non-Approximability of Bregman Clustering Problems

VIEW 1 EXCERPT
CITES METHODS

Bregman Clustering for Separable Instances

VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 41 REFERENCES

Weighted Graph Cuts without Eigenvectors A Multilevel Approach

VIEW 15 EXCERPTS
HIGHLY INFLUENTIAL

Convex Analysis

VIEW 5 EXCERPTS
HIGHLY INFLUENTIAL

Coresets and approximate clustering for Bregman divergences

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Approximation algorithms for co-clustering

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Clustering for metric and non-metric distance measures

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

k-means++: the advantages of careful seeding

VIEW 11 EXCERPTS
HIGHLY INFLUENTIAL

Clustering with Bregman Divergences

VIEW 5 EXCERPTS

An approximation ratio for biclustering

VIEW 1 EXCERPT