On Effectively Finding Maximal Quasi-cliques in Graphs

The problem of finding a maximum clique in a graph is prototypical for many clustering and similarity problems; however, in many real-world scenarios, the classical problem of finding a complete subgraph needs to be relaxed to finding an almost complete subgraph, a so-called quasi-clique . In this work, we demonstrate how two previously existing definitions of quasi-cliques can be unified and how the resulting, more general quasi-clique finding problem can be solved by extending two state-of-the-art stochastic local search algorithms for the classical maximum clique problem. Preliminary results for these algorithms applied to both, artificial and real-world problem instances demonstrate the usefulness of the new quasi-clique definition and the effectiveness of our algorithms.

[1]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[2]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[3]  Wayne J. Pullan,et al.  Dynamic Local Search for the Maximum Clique Problem , 2011, J. Artif. Intell. Res..

[4]  Marián Boguñá,et al.  Clustering in complex networks. II. Percolation properties. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[5]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[6]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[7]  Bart Selman,et al.  Natural communities in large linked networks , 2003, KDD '03.

[8]  R. Carter 11 – IT and society , 1991 .

[9]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All Maximal Cliques in Complex Network , 2006, Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06).

[10]  Hideo Matsuda,et al.  Classifying Molecular Sequences Using a Linkage Graph With Their Pairwise Similarities , 1999, Theor. Comput. Sci..

[11]  Roberto Battiti,et al.  Reactive local search for maximum clique: A new implementation , 2007 .

[12]  Wayne J. Pullan,et al.  Phased local search for the maximum clique problem , 2006, J. Comb. Optim..

[13]  Bart Selman,et al.  Tracking evolving communities in large linked networks , 2004, Proceedings of the National Academy of Sciences of the United States of America.

[14]  S. Borgatti,et al.  Analyzing Clique Overlap , 2009 .

[15]  Marián Boguñá,et al.  Clustering in complex networks. I. General formalism. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Jian Pei,et al.  On mining cross-graph quasi-cliques , 2005, KDD '05.

[17]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..