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

Found 1710 packages in 0.02 seconds

CholWishart — by Geoffrey Thompson, 2 years ago

Cholesky Decomposition of the Wishart Distribution

Sampling from the Cholesky factorization of a Wishart random variable, sampling from the inverse Wishart distribution, sampling from the Cholesky factorization of an inverse Wishart random variable, sampling from the pseudo Wishart distribution, sampling from the generalized inverse Wishart distribution, computing densities for the Wishart and inverse Wishart distributions, and computing the multivariate gamma and digamma functions. Provides a header file so the C functions can be called directly from other programs.

gdistance — by Andrew Marx, 7 months ago

Distances and Routes on Geographical Grids

Provides classes and functions to calculate various distance measures and routes in heterogeneous geographic spaces represented as grids. The package implements measures to model dispersal histories first presented by van Etten and Hijmans (2010) . Least-cost distances as well as more complex distances based on (constrained) random walks can be calculated. The distances implemented in the package are used in geographical genetics, accessibility indicators, and may also have applications in other fields of geospatial analysis.

randnet — by Tianxi Li, 9 months ago

Random Network Model Estimation, Selection and Parameter Tuning

Model fitting, model selection and parameter tuning procedures for a class of random network models. Many useful network modeling, estimation, and processing methods are included. The work to build and improve this package is partially supported by the NSF grants DMS-2015298 and DMS-2015134.

SESraster — by Neander Marcel Heming, a year ago

Raster Randomization for Null Hypothesis Testing

Randomization of presence/absence species distribution raster data with or without including spatial structure for calculating standardized effect sizes and testing null hypothesis. The randomization algorithms are based on classical algorithms for matrices (Gotelli 2000, ) implemented for raster data.

nor1mix — by Martin Maechler, 2 years ago

Normal aka Gaussian 1-d Mixture Models

Onedimensional Normal (i.e. Gaussian) Mixture Models (S3) Classes, for, e.g., density estimation or clustering algorithms research and teaching; providing the widely used Marron-Wand densities. Efficient random number generation and graphics. Fitting to data by efficient ML (Maximum Likelihood) or traditional EM estimation.

mvmeta — by Antonio Gasparrini, 6 years ago

Multivariate and Univariate Meta-Analysis and Meta-Regression

Collection of functions to perform fixed and random-effects multivariate and univariate meta-analysis and meta-regression.

MendelianRandomization — by Stephen Burgess, 2 years ago

Mendelian Randomization Package

Encodes several methods for performing Mendelian randomization analyses with summarized data. Summarized data on genetic associations with the exposure and with the outcome can be obtained from large consortia. These data can be used for obtaining causal estimates using instrumental variable methods.

arf — by Marvin N. Wright, a year ago

Adversarial Random Forests

Adversarial random forests (ARFs) recursively partition data into fully factorized leaves, where features are jointly independent. The procedure is iterative, with alternating rounds of generation and discrimination. Data becomes increasingly realistic at each round, until original and synthetic samples can no longer be reliably distinguished. This is useful for several unsupervised learning tasks, such as density estimation and data synthesis. Methods for both are implemented in this package. ARFs naturally handle unstructured data with mixed continuous and categorical covariates. They inherit many of the benefits of random forests, including speed, flexibility, and solid performance with default parameters. For details, see Watson et al. (2023) < https://proceedings.mlr.press/v206/watson23a.html>.

miceRanger — by Sam Wilson, 5 years ago

Multiple Imputation by Chained Equations with Random Forests

Multiple Imputation has been shown to be a flexible method to impute missing values by Van Buuren (2007) . Expanding on this, random forests have been shown to be an accurate model by Stekhoven and Buhlmann to impute missing values in datasets. They have the added benefits of returning out of bag error and variable importance estimates, as well as being simple to run in parallel.

GLMMadaptive — by Dimitris Rizopoulos, a year ago

Generalized Linear Mixed Models using Adaptive Gaussian Quadrature

Fits generalized linear mixed models for a single grouping factor under maximum likelihood approximating the integrals over the random effects with an adaptive Gaussian quadrature rule; Jose C. Pinheiro and Douglas M. Bates (1995) .