graphclust: Hierarchical Graph Clustering for a Collection of Networks

Graph clustering using an agglomerative algorithm to maximize the integrated classification likelihood criterion and a mixture of stochastic block models. The method is described in the article "Model-based graph clustering of a collection of networks using an agglomerative algorithm" by T. Rebafka (2022) <arXiv:2211.02314>.

Version: 1.0.2
Imports: blockmodels, igraph, parallel, sClust
Published: 2023-03-16
Author: Tabea Rebafka [aut, cre]
Maintainer: Tabea Rebafka <tabea.rebafka at>
License: GPL-2
NeedsCompilation: no
CRAN checks: graphclust results


Reference manual: graphclust.pdf


Package source: graphclust_1.0.2.tar.gz
Windows binaries: r-devel:, r-release:, r-oldrel:
macOS binaries: r-release (arm64): graphclust_1.0.2.tgz, r-oldrel (arm64): graphclust_1.0.2.tgz, r-release (x86_64): graphclust_1.0.2.tgz, r-oldrel (x86_64): graphclust_1.0.2.tgz
Old sources: graphclust archive


Please use the canonical form to link to this page.