Mixed integer programming formulations for clustering problems related to structural balance

Abstract In this work, we study graph clustering problems associated with structural balance. One of these problems is known in computer science literature as the correlation-clustering (CC) problem and another (RCC) can be viewed as its relaxed version. The solution of CC and RCC problems has been previously used in the literature as tools for the evaluation of structural balance in a social network. Our aim is to solve these problems to optimality. We describe integer linear programming formulations for these problems which includes the first mathematical formulation for the RCC problem. We also discuss alternative models for the relaxed structural balance and the solution of clustering problems associated with these new models. Numerical experiments are carried out with each formulation on a set of benchmark instances available in the literature.

[1]  Patrick Doreian,et al.  A multiple indicator approach to blockmodeling signed networks , 2008, Soc. Networks.

[2]  V. Traag,et al.  Community detection in networks with positive and negative links. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  P. Robert Duimering,et al.  A balance theory approach to group problem solving , 2008, Soc. Networks.

[4]  Rosa Figueiredo,et al.  The maximum balanced subgraph of a signed graph: Applications and solution approaches , 2014, Eur. J. Oper. Res..

[5]  Peter Abell,et al.  Structural Balance: A Dynamic Perspective , 2009 .

[6]  Victor A. Campos,et al.  On the asymmetric representatives formulation for the vertex coloring problem , 2005, Discret. Appl. Math..

[7]  David Kempe,et al.  Modularity-maximizing graph communities via mathematical programming , 2007, 0710.2533.

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

[9]  Mason A. Porter,et al.  Communities in Networks , 2009, ArXiv.

[10]  M. Brusco,et al.  Integer Programs for One- and Two-Mode Blockmodeling Based on Prespecified Image Matrices for Structural and Regular Equivalence. , 2009, Journal of mathematical psychology.

[11]  R. Solomon,et al.  Group Characteristics as Revealed in Sociometric Patterns and Personality Ratings , 1952 .

[12]  Nalan Gülpinar,et al.  Extracting pure network submatrices in linear programs using signed graphs , 2004, Discret. Appl. Math..

[13]  Mason A. Porter,et al.  Community Structure in the United Nations General Assembly , 2010, ArXiv.

[14]  Frank Harary,et al.  Signed graphs for portfolio analysis in risk management , 2002 .

[15]  George L. Nemhauser,et al.  Min-cut clustering , 1993, Math. Program..

[16]  Pierre Hansen,et al.  Cluster analysis and mathematical programming , 1997, Math. Program..

[17]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..

[18]  Rolf Niedermeier,et al.  Optimal Edge Deletions for Signed Graph Balancing , 2007, WEA.

[19]  G. Nemhauser,et al.  Integer Programming , 2020 .

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

[21]  John C. McKinney,et al.  An Educational Application of a Two-Dimensional Sociometric Test , 1948 .

[22]  J. Davis.  Clustering and Structural Balance in Graphs , 1967 .

[23]  Yuri Frota,et al.  Cliques, holes and the vertex coloring polytope , 2004, Inf. Process. Lett..

[24]  M. Brusco,et al.  K-balance partitioning: an exact method with applications to generalized structural balance and other psychological contexts. , 2010, Psychological methods.

[25]  T. Newcomb.  The acquaintance process , 1961 .

[26]  F. Harary,et al.  STRUCTURAL BALANCE: A GENERALIZATION OF HEIDER'S THEORY1 , 1977 .

[27]  P. Scarf,et al.  Fourth IMA International Conference on Modelling in Industrial Maintenance and Reliability , 2002 .

[28]  Nikhil Bansal,et al.  Correlation Clustering , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[29]  S K Manning,et al.  Similarity ratings and confusability of lipread consonants compared with similarity ratings of auditory and orthographic stimuli. , 1991, The American journal of psychology.

[30]  Jonathan F. Bard,et al.  The Mixed Integer Linear Bilevel Programming Problem , 1990, Oper. Res..

[31]  T. F. Noronha,et al.  A branch-and-cut algorithm for partition coloring , 2010 .

[32]  Eduardo D. Sontag,et al.  Algorithmic and complexity results for decompositions of biological networks into monotone subsystems , 2007, Biosyst..

[33]  Patrick Doreian,et al.  Partitioning signed social networks , 2009, Soc. Networks.

[34]  Jiming Liu,et al.  Community Mining from Signed Social Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[35]  Cid C. de Souza,et al.  An exact approach to the problem of extracting an embedded network matrix , 2011, Comput. Oper. Res..

[36]  Celso C. Ribeiro,et al.  A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives , 2009, Electron. Notes Discret. Math..

[37]  F. Heider.  Attitudes and cognitive organization. , 1946, The Journal of psychology.

[38]  M. Brusco,et al.  Two Algorithms for Relaxed Structural Balance Partitioning: Linking Theory, Models, and Data to Understand Social Network Phenomena , 2011 .

[39]  P. Doreian,et al.  A partitioning approach to structural balance , 1996 .

[40]  D. Cartwright,et al.  A note on a matrix criterion for unique colorability of a signed graph , 1967, Psychometrika.