Package: birankr
Title: Ranking Nodes in Bipartite and Weighted Networks
Version: 1.0.1
Authors@R: c(person("Brian", "Aronson",email = "bdaronson@gmail.com", role = c("aut", "cre")), person("Kai-Cheng", "Yang", email = "yangkc@iu.edu", role = "aut"))
Description: 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).
Depends: R (>= 3.4.0), Matrix, data.table
Suggests: testthat
License: MIT + file LICENSE
Encoding: UTF-8
LazyData: true
RoxygenNote: 7.0.2
NeedsCompilation: no
Packaged: 2020-03-23 17:07:09 UTC; admin
Author: Brian Aronson [aut, cre],
  Kai-Cheng Yang [aut]
Maintainer: Brian Aronson <bdaronson@gmail.com>
Repository: CRAN
Date/Publication: 2020-03-23 17:30:03 UTC
Built: R 4.3.3; ; 2025-01-24 04:49:32 UTC; unix
