A partitioning-based divisive clustering technique for maximizing the modularity

MaRDI QIDQ5298941zbMATH OpenFDO

Authors Kamer Kaya, Johannes Langguth, Bora Uçar, Ümit V. Çatalyürek

Publication date 25 June 2013

zbMATH Keywords

clusteringhypergraphsmodularity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Divisive heuristic for modularity density maximization
• On Finding Graph Clusterings with Maximum Modularity
• Reformulation of a model for hierarchical divisive graph modularity maximization
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
• A Scalable Multilevel Algorithm for Graph Clustering and Community Structure Detection

Cited in

(6)

• Graph clustering based on modularity variation estimations
• A locally optimal hierarchical divisive heuristic for bipartite modularity maximization
• Divisive heuristic for modularity density maximization
• Reformulation of a model for hierarchical divisive graph modularity maximization
• Attributed Networks Partitioning Based on Modularity Optimization
• Significance-Driven Graph Clustering

Describes a project that uses

Uses Software

• PaToH
• UbiCrawler

This page was built for publication: A partitioning-based divisive clustering technique for maximizing the modularity

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