Analysing structure in complex networks using quality functions evolved by genetic programming

When studying complex networks, we are often interested in identifying structures within the networks. Previous work has successfully used algorithmically identified network structures to predict functional groups; for example, where structures extracted from protein-protein interaction networks have been predictive of functional protein complexes. One way structures in complex networks have previously been described is as collections of nodes that maximise a local quality function. For a particular set of structures, we search the space of quality functions using Genetic Programming, to find a function that locally describes that set of structures. This technique allows us to investigate the common network properties of defined sets of structures. We also use this technique to classify and differentiate between different types of structure. We apply this method on several synthetic benchmarks, and on a protein-protein interaction network. Our results indicate this is a useful technique of investigating properties that sets of network structures have in common.

[1]  Shigehiko Kanaya,et al.  Development and implementation of an algorithm for detection of protein complexes in large interaction networks , 2006, BMC Bioinformatics.

[2]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[3]  Ian H. Witten,et al.  The WEKA data mining software: an update , 2009, SKDD.

[4]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[5]  R. Luce,et al.  A method of matrix analysis of group structure , 1949, Psychometrika.

[6]  Sean R. Collins,et al.  Toward a Comprehensive Atlas of the Physical Interactome of Saccharomyces cerevisiae*S , 2007, Molecular & Cellular Proteomics.

[7]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[8]  Roded Sharan,et al.  Identification of protein complexes by comparative analysis of yeast and bacterial protein interaction data , 2004, J. Comput. Biol..

[9]  Feng Luo,et al.  Exploring Local Community Structures in Large Networks , 2006, 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06).

[10]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[11]  A. Clauset Finding local community structure in networks. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[12]  Fergal Reid,et al.  Title Detecting Highly Overlapping Community Structure by Greedy Clique Expansion Detecting Highly Overlapping Community Structure by Greedy Clique Expansion , 2022 .

[13]  D. Bamber The area above the ordinal dominance graph and the area below the receiver operating characteristic graph , 1975 .

[14]  Xin Liu,et al.  Effective Algorithm for Detecting Community Structure in Complex Networks Based on GA and Clustering , 2007, International Conference on Computational Science.

[15]  Wolfgang Banzhaf,et al.  Discovery of email communication networks from the Enron corpus with a genetic algorithm using social network analysis , 2009, 2009 IEEE Congress on Evolutionary Computation.

[16]  Stanley Milgram,et al.  An Experimental Study of the Small World Problem , 1969 .

[17]  John C. Platt,et al.  Fast training of support vector machines using sequential minimal optimization, advances in kernel methods , 1999 .

[18]  Dumitru Dumitrescu,et al.  Community Detection in Complex Networks Using Collaborative Evolutionary Algorithms , 2007, ECAL.

[19]  HERBERT A. SIMON,et al.  The Architecture of Complexity , 1991 .

[20]  Illés J. Farkas,et al.  CFinder: locating cliques and overlapping modules in biological networks , 2006, Bioinform..

[21]  J. Ross Quinlan,et al.  C4.5: Programs for Machine Learning , 1992 .

[22]  John R. Koza,et al.  Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.