Bootstrap clustering for graph partitioning

RAIRO - Operations Research

Volumn 45, Issue 4, 2011, Pages 339-352

  Gambette, Philippe ^a   Guénoche, Alain ^a  

^a CNRS   (France)

Author keywords

Bootstrap; Clustering; Consensus of partitions; Graph partitioning; Modularity

Indexed keywords

GRAPH ALGORITHMS; GRAPH STRUCTURES; GRAPH THEORY;

BOOTSTRAP; CLUSTERING; CONSENSUS OF PARTITIONS; GRAPH PARTITIONING; MODULARITY;

CLUSTERING ALGORITHMS;

EID: 84859786840     PISSN: 03990559     EISSN: 28047303     Source Type: Journal    
DOI: 10.1051/ro/2012001     Document Type: Article

References (20)

1. D. Aloise, S. Cafieri, G. Caporossi, P. Hansen, L. Liberti and S. Perron, Column generation algorithms for exact modularity maximization in networks. Phys. Rev. E 82 (2010) 046112.
2. J.B. Angelelli, A. Baudot, C. Brun and A. Guénoche, Two local dissimilarity measures for weighted graph with application to biological networks. Adv. Data Anal. Classif. 2 (2008) 3-16.
3. J.P. Barthélemy and B. Leclerc, The median procedure for partitions. DIMACS series in Discrete Mathematics and Theoretical Computer Science 19 (1995) 3-34.
4. V. Blondel, J.-L. Guillaume, R. Lambiotte and E. Lefebvre, Fast unfolding of communities in large networks. J. Stat. Mech. Theor. Exp. (2008) P10008.
5. U. Brandes, D. Delling, M. Gaertler, R. Görke, M. Hoefer, Z. Nikoloski and D. Wagner, On modularity-NP-completeness and beyond. Proceedings of WG 2007. Lett. Notes Comput. Sci. 4769 (2007) 121-132.
6. S.V. Dale and C.J. Stoeckert Jr., Computational modeling of the Plasmodium falciparum interactome reveals protein function on a genome-wide scale. Gen. Res. 16 (2006) 542-549.
7. A.C. Davison and D.V. Hinkley, Bootstrap methods and their application. Cambridge University Press (1997).
8. L.R. Dice, Measures of the amount of ecologic association between species. Ecology 26 (1945) 297-302.
9. J. Duch and A. Arenas, Community detection in complex networks using extremal optimization. Phys. Rev. E 72 (2005) 027104.
10. J. Felsenstein, Inferring Phylogenies. Sunderland (MA), Sinauer Associates Inc. (2003).
11. S. Fortunato, Community detection in graphs. Phys. Rep. 486 (2010) 75-174.
12. A. Guénoche, Comparison of algorithms in graph partitioning. RAIRO 42 (2008) 469-484.
13. A. Guénoche, Consensus of partitions : a constructive approach. Adv. Data Anal. Classif. 5 (2011) 215-229.
14. L. Hubert and P. Arabie, Comparing partitions, J. Classif. 2 (1985) 193-218.
15. A.K. Jain and J.V. Moreau, Bootstrap technique in cluster analysis. Pattern Recogn. 20 (1987) 547-568.
16. M.E.J. Newman, Modularity and community structure in networks. PNAS 103 (2006) 8577-8582. (Pubitemid 43878062)
17. M.E.J. Newman and M. Girvan, Finding and evaluating community structure in networks. Phys. Rev. E 69 (2004) 026133.
18. A. Noack and R. Rotta, Multi-level algorithms for modularity clustering, Proceedings of SEA'2009, edited by J. Vahrenhold. Lett. Notes Comput. Sci. 5526 (2009) 257-268.
19. S. Régnier, Sur quelques aspects mathématiques des problèmes de classification automatique. I.C.C. Bulletin 4 (1965) 175-191. Reprint, Math. Sci. Hum. 82 (1983) 13-29.
20. C.T. Zahn, Approximating symmetric relations by equivalence relations. SIAM J. Appl. Math. 12 (1964) 840-847.