The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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 clustering of multiple networks with a hierarchical algorithm" by T. Rebafka (2022) <doi:10.48550/arXiv.2211.02314>.
| Version: | 1.3 |
| Imports: | blockmodels, igraph, parallel, sClust |
| Published: | 2023-06-07 |
| DOI: | 10.32614/CRAN.package.graphclust |
| Author: | Tabea Rebafka [aut, cre] |
| Maintainer: | Tabea Rebafka <tabea.rebafka at sorbonne-universite.fr> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | graphclust results |
| Reference manual: | graphclust.pdf |
| Package source: | graphclust_1.3.tar.gz |
| Windows binaries: | r-devel: graphclust_1.3.zip, r-release: graphclust_1.3.zip, r-oldrel: graphclust_1.3.zip |
| macOS binaries: | r-release (arm64): graphclust_1.3.tgz, r-oldrel (arm64): graphclust_1.3.tgz, r-release (x86_64): graphclust_1.3.tgz, r-oldrel (x86_64): graphclust_1.3.tgz |
| Old sources: | graphclust archive |
Please use the canonical form https://CRAN.R-project.org/package=graphclust to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.