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) . 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).


News

Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("birankr")

1.0.1 by Brian Aronson, 7 months ago


Browse source code at https://github.com/cran/birankr


Authors: Brian Aronson [aut, cre] , Kai-Cheng Yang [aut]


Documentation:   PDF Manual  


MIT + file LICENSE license


Depends on Matrix, data.table

Suggests testthat


See at CRAN