A Constant-Factor Approximation Algorithm for Co-clustering

@article{Anagnostopoulos2012ACA,
  title={A Constant-Factor Approximation Algorithm for Co-clustering},
  author={Aris Anagnostopoulos and Anirban Dasgupta and R. C. K. Kumar},
  journal={Theory of Computing},
  year={2012},
  volume={8},
  pages={597-622}
}
Co-clustering is the simultaneous partitioning of the rows and columns of a matrix such that the blocks induced by the row/column partitions are good clusters. Motivated by several applications in text mining, market-basket analysis, and bioinformatics, this problem has attracted a lot of attention in the past few years. Unfortunately, to date, most of the algorithmic work on this problem has been heuristic in nature. In this work we obtain the first approximation algorithms for the co… CONTINUE READING

References

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

DESHPANDE, PIERRE HANSEN, AND PREYAS POPAT: NP-hardness of Euclidean sum-of-squares clustering

DANIEL ALOISE, AMIT
  • Machine Learning,
  • 2009
VIEW 1 EXCERPT

An approximation ratio for biclustering

R ODED S HARAN
  • Inform . Process . Lett .
  • 2008

GARRIGA: An approximation ratio for biclustering

KAI PUOLAMÄKI, SAMI HANHIJÄRVI, C GEMMA
  • Inform. Process. Lett., 108(2):45–49,
  • 2008
VIEW 1 EXCERPT

SIVAKUMAR: Programmable clustering

SREENIVAS GOLLAPUDI, RAVI KUMAR
  • In Proc. 25th Symp. on Principles of Database Systems
  • 2006
VIEW 1 EXCERPT

Biclustering of expression data using simulated annealing

  • 18th IEEE Symposium on Computer-Based Medical Systems (CBMS'05)
  • 2005

QIAN-SHENG CHENG, AND WEI-YING MA: Consistent bipartite graph co-partitioning for star-structured high-order heterogeneous data co-clustering

GAO BIN, LIU TIE-YAN, ZHENG XIN
  • In Proc. 11th Internat. Conf. on Knowledge Discovery and Data Mining (KDD’05),
  • 2005
VIEW 1 EXCERPT

Similar Papers

Loading similar papers…