Bootstrap clustering for graph partitioning

DOI10.1051/ro/2012001zbMath1238.05116OpenAlexW2145381074WikidataQ58172965 ScholiaQ58172965MaRDI QIDQ5388153

Philippe Gambette, Alain Guénoche

Publication date: 18 April 2012

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/222512

zbMATH Keywords

bootstrapclusteringgraph partitioningmodularityconsensus of partitions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Bootstrap, jackknife and other resampling methods (62F40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)

Related Items (1)

Social Network Optimization for Cluster Ensemble Selection

Uses Software

• bootlib

Cites Work

• Two local dissimilarity measures for weighted graphs with application to protein interaction networks
• Consensus of partitions: a constructive approach
• Comparison of algorithms in graph partitioning
• Approximating Symmetric Relations by Equivalence Relations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bootstrap clustering for graph partitioning