birankr: Ranking Nodes in Bipartite and Weighted Networks

Highly efficient functions for estimating various rank (centrality) measures of nodes in bipartite graphs (two-mode networks). Includes methods for estimating HITS, CoHITS, BGRM, and BiRank with implementation primarily inspired by He et al. (2016) <doi:10.1109/TKDE.2016.2611584>. Also provides easy-to-use tools for efficiently estimating PageRank in one-mode graphs, incorporating or removing edge-weights during rank estimation, projecting two-mode graphs to one-mode, and for converting edgelists and matrices to sparseMatrix format. Best of all, the package's rank estimators can work directly with common formats of network data including edgelists (class data.frame, data.table, or tbl_df) and adjacency matrices (class matrix or dgCMatrix).

Version: 1.0.0
Depends: R (≥ 3.4.0), Matrix, data.table
Published: 2020-01-26
Author: Brian Aronson [aut, cre], Kai-Cheng Yang [aut]
Maintainer: Brian Aronson <bdaronson at gmail.com>
License: MIT + file LICENSE
NeedsCompilation: no
Materials: README
CRAN checks: birankr results

Downloads:

Reference manual: birankr.pdf
Package source: birankr_1.0.0.tar.gz
Windows binaries: r-devel: birankr_1.0.0.zip, r-devel-gcc8: birankr_1.0.0.zip, r-release: birankr_1.0.0.zip, r-oldrel: birankr_1.0.0.zip
OS X binaries: r-release: birankr_1.0.0.tgz, r-oldrel: birankr_1.0.0.tgz

Linking:

Please use the canonical form https://CRAN.R-project.org/package=birankr to link to this page.