Found 185 packages in 0.07 seconds
Fast, Dependency-Free Geodesic Distance Calculations
Dependency-free, ultra fast calculation of geodesic
distances. Includes the reference nanometre-accuracy geodesic
distances of Karney (2013)
Computational Geometry
R interface to (some of) cddlib (< https://github.com/cddlib/cddlib>). Converts back and forth between two representations of a convex polytope: as solution of a set of linear equalities and inequalities and as convex hull of set of points and rays. Also does linear programming and redundant generator elimination (for example, convex hull in n dimensions). All functions can use exact infinite-precision rational arithmetic.
D3 JavaScript Network Graphs from R
Creates 'D3' 'JavaScript' network, tree, dendrogram, and Sankey graphs from 'R'.
Complete Environment for Bayesian Inference
Provides a complete environment for Bayesian inference using a variety of different samplers (see ?LaplacesDemon for an overview).
Classify Names by Gender, U.S. Ethnicity, and Leaf Nationality
Functions to use the 'NamePrism' API < https://www.name-prism.com/api> or 'NamSor' API v2 < https://namsor.app/> for classifying names based on gender, 6 U.S. ethnicities, or 39 leaf nationalities. Updated to work with current API endpoints.
Bayesian Additive Regression Trees
Bayesian Additive Regression Trees (BART) provide flexible nonparametric modeling of covariates for continuous, binary, categorical and time-to-event outcomes. For more information see Sparapani, Spanbauer and McCulloch
Companion Package for the Book "Model-Based Clustering and Classification for Data Science"
The companion package provides all original data sets and functions that are used in the book "Model-Based Clustering and Classification for Data Science" by Charles Bouveyron, Gilles Celeux, T. Brendan Murphy and Adrian E. Raftery (2019, ISBN:9781108644181).
Markov Chain Monte Carlo
Simulates continuous distributions of random vectors using
Markov chain Monte Carlo (MCMC). Users specify the distribution by an
R function that evaluates the log unnormalized density. Algorithms
are random walk Metropolis algorithm (function metrop), simulated
tempering (function temper), and morphometric random walk Metropolis
(Johnson and Geyer, 2012,
Manage Massive Matrices with Shared Memory and Memory-Mapped Files
Create, store, access, and manipulate massive matrices. Matrices are allocated to shared memory and may use memory-mapped files. Packages 'biganalytics', 'bigtabulate', 'synchronicity', and 'bigalgebra' provide advanced functionality.
Access Domains and Search Popular Websites
Functions that allow for accessing domains and a number of search engines.