Comparison of algorithms in graph partitioning

We first describe four recent methods to cluster vertices of an undirected non weighted connected graph. They are all based on very different principles. The fifth is a combination of classical ideas in optimization applied to graph partitioning. We compare these methods according to their ability to recover classes initially introduced in random graphs with more edges within the classes than between them.

[1]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[2]  M. Newman,et al.  Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[3]  André Hardy,et al.  An examination of procedures for determining the number of clusters in a data set , 1994 .

[4]  Alain Guénoche,et al.  Clustering proteins from interaction networks for the prediction of cellular functions , 2004, BMC Bioinformatics.

[5]  James Moody,et al.  Peer influence groups: identifying dense clusters in large networks , 2001, Soc. Networks.

[6]  Anton J. Enright,et al.  An efficient algorithm for large-scale detection of protein families. , 2002, Nucleic acids research.

[7]  Alain Guénoche,et al.  Maximum Transfer Distance Between Partitions , 2006, J. Classif..

[8]  Alain Guénoche.  Clustering by Vertex Density in a Graph , 2004 .

[9]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

[10]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[11]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

[12]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[13]  S. Dongen.  Graph clustering by flow simulation , 2000 .

[14]  S. Régnier,et al.  Sur quelques aspects mathématiques des problèmes de classification automatique , 1983 .

[15]  Vladimir Batagelj,et al.  Partitioning Approach to Visualization of Large Graphs , 1999, GD.

[17]  Alain Guénoche.  Partitions optimisées selon différents critères : Evaluation et comparaison , 2003 .

[18]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

[20]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[21]  William H. E. Day,et al.  Extremes in the Complexity of Computing Metric Distances Between Partitions , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[22]  Vladimir Batagelj,et al.  An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.

[23]  Jacques Rougemont,et al.  DNA microarray data and contextual analysis of correlation graphs , 2003, BMC Bioinformatics.

[24]  Jacques van Helden,et al.  Evaluation of clustering algorithms for protein-protein interaction networks , 2006, BMC Bioinformatics.

[25]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.