Online correlation clustering

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 573-584

  Mathieu, Claire ^a   Sankur, Ocan ^a,b   Schudy, Warren ^a  

^a Brown University   (United States)

^b ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

Correlation clustering; Online algorithms

Indexed keywords

COMPETITIVE RATIO; CORRELATION CLUSTERING; GREEDY ALGORITHMS; ON-LINE ALGORITHMS; ON-LINE FASHION; ONLINE-CLUSTERING; RANDOMIZED ALGORITHMS; SIMILARITY CLASS;

COMPUTER SCIENCE;

CLUSTERING ALGORITHMS;

EID: 79960013155     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2486     Document Type: Conference Paper

References (15)

1. Nir Ailon, Moses Charikar, and Alantha Newman. Aggregating inconsistent information: ranking and clustering. In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pages 684-693, New York, NY, USA, 2005. ACM Press.
2. Nikhil Bansal, Avrim Blum, and Shuchi Chawla. Correlation clustering. Mach. Learn., 56(1-3):89-113, 2004.
3. Amir Ben-Dor, Ron Shamir, and Zohar Yakhini. Clustering gene expression patterns. Journal of Computational Biology, 6(3-4):281-297, 1999.
4. Allan Borodin and Ran El-Yaniv. Online computation and competitive analysis. Cambridge University Press, New York, NY, USA, 1998.
5. Moses Charikar, Chandra Chekuri, Tomas Feder, and Rajeev Motwani. Incremental clustering and dynamic information retrieval. SIAM J. Comput., 33(6):1417-1440, 2004.
6. Moses Charikar, Venkatesan Guruswami, and Anthony Wirth. Clustering with qualitative information. In focs, volume 00, page 524, Los Alamitos, CA, USA, 2003. IEEE Computer Society.
7. Moses Charikar, Venkatesan Guruswami, and Anthony Wirth. Clustering with qualitative information. J. Comput. Syst. Sci., 71(3):360-383, 2005.
8. William W. Cohen and Jacob Richman. Learning to match and cluster large high-dimensional data sets for data integration. In KDD '02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 475-480, New York, NY, USA, 2002. ACM.
9. Erik D. Demaine, Dotan Emanuel, Amos Fiat, and Nicole Immorlica. Correlation clustering in general weighted graphs. Theor. Comput. Sci., 361(2):172-187, 2006.
10. Jenny Rose Finkel and Christopher D. Manning. Enforcing transitivity in coreference resolution. In Proceedings of ACL-08: HLT, Short Papers, pages 45-48, Columbus, Ohio, June 2008. Association for Computational Linguistics.
11. Ioannis Giotis and Venkatesan Guruswami. Correlation clustering with a fixed number of clusters. Theory of Computing, 2(1):249-266, 2006.
12. Thorsten Joachims and John Hopcroft. Error bounds for correlation clustering. In ICML '05: Proceedings of the 22nd international conference on Machine learning, pages 385-392, New York, NY, USA, 2005. ACM.
13. Marek Karpinski and Warren Schudy. Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems. In STOC '09: Proceedings of the 41st annual ACM symposium on Theory of computing, pages 313-322, 2009.
14. st SODA, preprint: http://www.cs.brown.edu/~ws/papers/cluster.pdf, 2010.
15. Ron Shamir, Roded Sharan, and Dekel Tsur. Cluster graph modification problems. Discrete Appl. Math., 144(1-2):173-182, 2004.