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.

BipartiteModularityMaximization: Partition Bipartite Network into Non-Overlapping Biclusters by Optimizing Bipartite Modularity

Function bipmod() that partitions a bipartite network into non-overlapping biclusters by maximizing bipartite modularity defined in Barber (2007) <doi:10.1103/PhysRevE.76.066102> using the bipartite version of the algorithm described in Treviño (2015) <doi:10.1088/1742-5468/2015/02/P02003>.

Version: 1.23.120.1
Depends: R (≥ 2.10)
Imports: Rcpp
LinkingTo: Rcpp
Suggests: testthat
Published: 2023-01-21
DOI: 10.32614/CRAN.package.BipartiteModularityMaximization
Author: Tianlong Chen [aut], Weibin Zhang [cre, ctb], Suresh Bhavnani [cph, fnd]
Maintainer: Weibin Zhang <wbzhang.ustc at gmail.com>
License: MIT + file LICENSE
NeedsCompilation: yes
Materials: README NEWS
CRAN checks: BipartiteModularityMaximization results

Documentation:

Reference manual: BipartiteModularityMaximization.pdf

Downloads:

Package source: BipartiteModularityMaximization_1.23.120.1.tar.gz
Windows binaries: r-devel: BipartiteModularityMaximization_1.23.120.1.zip, r-release: BipartiteModularityMaximization_1.23.120.1.zip, r-oldrel: BipartiteModularityMaximization_1.23.120.1.zip
macOS binaries: r-release (arm64): BipartiteModularityMaximization_1.23.120.1.tgz, r-oldrel (arm64): BipartiteModularityMaximization_1.23.120.1.tgz, r-release (x86_64): BipartiteModularityMaximization_1.23.120.1.tgz, r-oldrel (x86_64): BipartiteModularityMaximization_1.23.120.1.tgz
Old sources: BipartiteModularityMaximization archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=BipartiteModularityMaximization 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.