Correlation Clustering Generalized

We present new results for LambdaCC and MotifCC, two recently introduced variants of the well-studied correlation clustering problem. Both variants are motivated by applications to network analysis and community detection, and have non-trivial approximation algorithms. We first show that the standard linear programming relaxation of LambdaCC has a Theta(log n) integrality gap for a certain choice of the parameter lambda. This sheds light on previous challenges encountered in obtaining parameter-independent approximation results for LambdaCC. We generalize a previous constant-factor algorithm to provide the best results, from the LP-rounding approach, for an extended range of lambda. MotifCC generalizes correlation clustering to the hypergraph setting. In the case of hyperedges of degree 3 with weights satisfying probability constraints, we improve the best approximation factor from 9 to 8. We show that in general our algorithm gives a 4(k-1) approximation when hyperedges have maximum degree k and probability weights. We additionally present approximation results for LambdaCC and MotifCC where we restrict to forming only two clusters.

[1]  Avrim Blum,et al.  Correlation Clustering , 2004, Machine Learning.

[2]  Subhash Khot,et al.  On the power of unique 2-prover 1-round games , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[3]  Satyen Kale.  Efficient algorithms using the multiplicative weights update method , 2007 .

[4]  Takuro Fukunaga.  LP-based pivoting algorithm for higher-order correlation clustering , 2019, J. Comb. Optim..

[5]  A KhotSubhash,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative-Type Metrics into ℓ1 , 2015 .

[6]  James Saunderson,et al.  A Local-Search 2-Approximation for 2-Correlation-Clustering , 2008, ESA.

[7]  Nisheeth K. Vishnoi,et al.  The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into l1 , 2005, FOCS.

[8]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[9]  Tselil Schramm,et al.  Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs , 2014, STOC.

[10]  Eduardo D. Sontag,et al.  Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems , 2005, WEA.

[11]  Olgica Milenkovic,et al.  Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds , 2014, SIAM J. Optim..

[12]  Yuval Rabani,et al.  ON THE HARDNESS OF APPROXIMATING MULTICUT AND SPARSEST-CUT , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[13]  Venkatesan Guruswami,et al.  Clustering with qualitative information , 2005, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[14]  Nir Ailon,et al.  Aggregating inconsistent information: Ranking and clustering , 2008 .

[15]  Anthony Wirth,et al.  Correlation Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[16]  David F. Gleich,et al.  A Correlation Clustering Framework for Community Detection , 2018, WWW.

[17]  Amos Fiat,et al.  Correlation clustering in general weighted graphs , 2006, Theor. Comput. Sci..

[18]  Amit Agarwal,et al.  O(√log n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems , 2005, STOC '05.

[19]  Avi Wigderson,et al.  Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[20]  David P. Williamson,et al.  Deterministic pivoting algorithms for constrained ranking and clustering problems , 2007, SODA '07.

[21]  Sebastian Nowozin,et al.  Higher-Order Correlation Clustering for Image Segmentation , 2011, NIPS.

[22]  Hoang Dau,et al.  Motif clustering and overlapping clustering for social network analysis , 2016, IEEE INFOCOM 2017 - IEEE Conference on Computer Communications.

[23]  E. Felten,et al.  RECOMMENDED FOR ACCEPTANCE , 1990 .

[24]  Venkatesan Guruswami,et al.  Correlation clustering with a fixed number of clusters , 2005, SODA '06.

[25]  Jure Leskovec,et al.  Higher-order organization of complex networks , 2016, Science.

[26]  Subhash Khot.  On the power of unique 2-prover 1-round games , 2002, STOC '02.