An ensemble learning strategy for graph clustering

MaRDI QIDQ5298943zbMATH OpenFDO

Authors Michael Ovelgönne, Andreas Geyer-Schulz

Publication date 25 June 2013

zbMATH Keywords

graph clustering, ensemble learning

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Recommendations

• Social network optimization for cluster ensemble selection
• Ensemble clustering using factor graph
• Memetic graph clustering
• On Finding Graph Clusterings with Maximum Modularity
• 10.1162/153244303321897735

Cited in

(7)

• Post-processing partitions to identify domains of modularity optimization
• Ensemble clustering using factor graph
• Ascent-descent variable neighborhood decomposition search for community detection by modularity maximization
• Efficient modularity density heuristics for large graphs
• Social network optimization for cluster ensemble selection
• Memetic graph clustering
• Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering

This page was built for publication: An ensemble learning strategy for graph clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5298943)