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

Found 124 packages in 0.07 seconds

mathml — by Matthias Gondan, 9 months ago

Translate R Expressions to 'MathML' and 'LaTeX'/'MathJax'

Translate R expressions to 'MathML' or 'MathJax'/'LaTeX' so that they can be rendered in 'R Markdown' documents and shiny apps. This package depends on R package 'rolog', which requires an installation of the 'SWI-Prolog' runtime either from 'swi-prolog.org' or from R package 'rswipl'.

TraMineR — by Gilbert Ritschard, 3 months ago

Trajectory Miner: a Sequence Analysis Toolkit

Set of sequence analysis tools for manipulating, describing and rendering categorical sequences, and more generally mining sequence data in the field of social sciences. Although this sequence analysis package is primarily intended for state or event sequences that describe time use or life courses such as family formation histories or professional careers, its features also apply to many other kinds of categorical sequence data. It accepts many different sequence representations as input and provides tools for converting sequences from one format to another. It offers several functions for describing and rendering sequences, for computing distances between sequences with different metrics (among which optimal matching), original dissimilarity-based analysis tools, and functions for extracting the most frequent event subsequences and identifying the most discriminating ones among them. A user's guide can be found on the TraMineR web page.

simfinapi — by Matthias Gomolka, 2 months ago

Accessing 'SimFin' Data

Through simfinapi, you can intuitively access the 'SimFin' Web-API (< https://www.simfin.com/>) to make 'SimFin' data easily available in R. To obtain an 'SimFin' API key (and thus to use this package), you need to register at < https://app.simfin.com/login>.

RcppGreedySetCover — by Matthias Kaeding, 6 years ago

Greedy Set Cover

A fast implementation of the greedy algorithm for the set cover problem using 'Rcpp'.

mod2rm — by Matthias Forstmann, 2 years ago

Moderation Analysis for Two-Instance Repeated Measures Designs

Multiple moderation analysis for two-instance repeated measures designs, with up to three simultaneous moderators (dichotomous and/or continuous) with additive or multiplicative relationship. Includes analyses of simple slopes and conditional effects at (automatically determined or manually set) values of the moderator(s), as well as an implementation of the Johnson-Neyman procedure for determining regions of significance in single moderator models. Based on Montoya, A. K. (2018) "Moderation analysis in two-instance repeated measures designs: Probing methods and multiple moderator models" .

taxize — by Zachary Foster, 2 years ago

Taxonomic Information from Around the Web

Interacts with a suite of web 'APIs' for taxonomic tasks, such as getting database specific taxonomic identifiers, verifying species names, getting taxonomic hierarchies, fetching downstream and upstream taxonomic names, getting taxonomic synonyms, converting scientific to common names and vice versa, and more.

ROptEstOld — by Matthias Kohl, 5 years ago

Optimally Robust Estimation - Old Version

Optimally robust estimation using S4 classes and methods. Old version still needed for current versions of ROptRegTS and RobRex.

RobRex — by Matthias Kohl, 5 years ago

Optimally Robust Influence Curves for Regression and Scale

Functions for the determination of optimally robust influence curves in case of linear regression with unknown scale and standard normal distributed errors where the regressor is random.

RobLoxBioC — by Matthias Kohl, 2 months ago

Infinitesimally Robust Estimators for Preprocessing -Omics Data

Functions for the determination of optimally robust influence curves and estimators for preprocessing omics data, in particular gene expression data (Kohl and Deigner (2010), ).

VeccTMVN — by Jian Cao, 3 months ago

Multivariate Normal Probabilities using Vecchia Approximation

Under a different representation of the multivariate normal (MVN) probability, we can use the Vecchia approximation to sample the integrand at a linear complexity with respect to n. Additionally, both the SOV algorithm from Genz (92) and the exponential-tilting method from Botev (2017) can be adapted to linear complexity. The reference for the method implemented in this package is Jian Cao and Matthias Katzfuss (2024) "Linear-Cost Vecchia Approximation of Multivariate Normal Probabilities" . Two major references for the development of our method are Alan Genz (1992) "Numerical Computation of Multivariate Normal Probabilities" and Z. I. Botev (2017) "The Normal Law Under Linear Restrictions: Simulation and Estimation via Minimax Tilting" .