Examples: visualization, C++, networks, data cleaning, html widgets, ropensci.

Found 1181 packages in 0.03 seconds

tergm — by Pavel N. Krivitsky, a year ago

Fit, Simulate and Diagnose Models for Network Evolution Based on Exponential-Family Random Graph Models

An integrated set of extensions to the 'ergm' package to analyze and simulate network evolution based on exponential-family random graph models (ERGM). 'tergm' is a part of the 'statnet' suite of packages for network analysis. See Krivitsky and Handcock (2014) and Carnegie, Krivitsky, Hunter, and Goodreau (2015) .

backbone — by Zachary Neal, 5 months ago

Extracts the Backbone from Networks

An implementation of methods for extracting a sparse unweighted network (i.e. a backbone) from an unweighted network (e.g., Hamann et al., 2016 ), a weighted network (e.g., Serrano et al., 2009 ), or a weighted projection (e.g., Neal et al., 2021 ).

GeneNet — by Korbinian Strimmer, a year ago

Modeling and Inferring Gene Networks

Analyzes gene expression (time series) data with focus on the inference of gene networks. In particular, GeneNet implements the methods of Schaefer and Strimmer (2005a,b,c) and Opgen-Rhein and Strimmer (2006, 2007) for learning large-scale gene association networks (including assignment of putative directions).

bionetdata — by Giorgio Valentini, 4 years ago

Biological and Chemical Data Networks

Data Package that includes several examples of chemical and biological data networks, i.e. data graph structured.

ndtv — by Skye Bender-deMoll, 2 years ago

Network Dynamic Temporal Visualizations

Renders dynamic network data from 'networkDynamic' objects as movies, interactive animations, or other representations of changing relational structures and attributes.

netrankr — by David Schoch, a year ago

Analyzing Partial Rankings in Networks

Implements methods for centrality related analyses of networks. While the package includes the possibility to build more than 20 indices, its main focus lies on index-free assessment of centrality via partial rankings obtained by neighborhood-inclusion or positional dominance. These partial rankings can be analyzed with different methods, including probabilistic methods like computing expected node ranks and relative rank probabilities (how likely is it that a node is more central than another?). The methodology is described in depth in the vignettes and in Schoch (2018) .

cito — by Maximilian Pichler, 2 years ago

Building and Training Neural Networks

The 'cito' package provides a user-friendly interface for training and interpreting deep neural networks (DNN). 'cito' simplifies the fitting of DNNs by supporting the familiar formula syntax, hyperparameter tuning under cross-validation, and helps to detect and handle convergence problems. DNNs can be trained on CPU, GPU and MacOS GPUs. In addition, 'cito' has many downstream functionalities such as various explainable AI (xAI) metrics (e.g. variable importance, partial dependence plots, accumulated local effect plots, and effect estimates) to interpret trained DNNs. 'cito' optionally provides confidence intervals (and p-values) for all xAI metrics and predictions. At the same time, 'cito' is computationally efficient because it is based on the deep learning framework 'torch'. The 'torch' package is native to R, so no Python installation or other API is required for this package.

multinet — by Matteo Magnani, 2 months ago

Analysis and Mining of Multilayer Social Networks

Functions for the creation/generation and analysis of multilayer social networks .

tsna — by Skye Bender-deMoll, a year ago

Tools for Temporal Social Network Analysis

Temporal SNA tools for continuous- and discrete-time longitudinal networks having vertex, edge, and attribute dynamics stored in the 'networkDynamic' format. This work was supported by grant R01HD68395 from the National Institute of Health.

bnstruct — by Alberto Franzin, 2 years ago

Bayesian Network Structure Learning from Data with Missing Values

Bayesian Network Structure Learning from Data with Missing Values. The package implements the Silander-Myllymaki complete search, the Max-Min Parents-and-Children, the Hill-Climbing, the Max-Min Hill-climbing heuristic searches, and the Structural Expectation-Maximization algorithm. Available scoring functions are BDeu, AIC, BIC. The package also implements methods for generating and using bootstrap samples, imputed data, inference.