This package provides a statistical tool for multivariate modeling and clustering using stepwise cluster analysis. The modeling output of rSCA is constructed as a cluster tree to represent the complicated relationships between multiple dependent and independent variables. A free tool (named rSCA Tree Generator) for visualizing the cluster tree from rSCA is also released and it can be downloaded at <rscatree.weebly.com>.

This package performs kernel based estimates on in-memory raster images from the raster package. These kernel estimates include local means variances, modes, and quantiles. All results are in the form of raster images, preserving original resolution and projection attributes.

Implementation of the Robust Gauss-Newton (RGN) algorithm, designed for solving optimization problems with a sum of least squares objective function. For algorithm details please refer to Qin et. al. (2018) <doi:10.1029/2017WR022488>.

Testing and inference for regression models using residual randomization methods. The basis of inference is an invariance assumption on the regression errors, e.g., clustered errors, or doubly-clustered errors.

Automatic, semi-automatic, and manual functions for generating color maps from images. The idea is to simplify the colors of an image according to a metric that is useful for the user, using deterministic methods whenever possible. Many images will be clustered well using the out-of-the-box functions, but the package also includes a toolbox of functions for making manual adjustments (layer merging/isolation, blurring, fitting to provided color clusters or those from another image, etc). Also includes export methods for other color/pattern analysis packages (pavo, patternize, colordistance).

In data science, it is a common practice to compute a series of columns (e.g. features) against a common response vector. Various metrics are provided with efficient computation implemented with Rcpp'.

Helper functions to accompany the Blair, Coppock, and Humphreys (2022) "Research Design in the Social Sciences: Declaration, Diagnosis, and Redesign" <https://book.declaredesign.org>. rdss includes datasets, helper functions, and plotting components to enable use and replication of the book.

Interface for multiple data sources, such as the `EDDS` API <https://evds2.tcmb.gov.tr/index.php?/evds/userDocs> of the Central Bank of the Republic of Türkiye and the `FRED` API <https://fred.stlouisfed.org/docs/api/fred/> of the Federal Reserve Bank. Both data providers require API keys for access, which users can easily obtain by creating accounts on their respective websites. The package provides caching ability with the selection of periods to increase the speed and efficiency of requests. It combines datasets requested from different sources, helping users when the data has common frequencies. While combining data frames whenever possible, it also keeps all requested data available as separate data frames to increase efficiency.

Implementation of JQuery <https://jquery.com> and CSS styles to allow the display of fireworks on a document. Toolkit to easily incorporate celebratory splashes in Rmarkdown and shiny apps.

This package provides functions to compute the modularity and modularity-related roles in networks. It is a wrapper around the rgraph library (Guimera & Amaral, 2005, <doi:10.1038/nature03288>).

This package provides an R interface to Python's pandas library using non-standard evaluation. Users can write R code (e.g., rp_filter(), rp_select(), rp_mutate()) that is translated into pandas commands and executed via reticulate'. Supports chaining, grouping, and summarisation', and includes a table_name parameter to generate copy-pasteable Python code. Ideal for leveraging pandas speed and flexibility within the R ecosystem.

Interface to JDemetra+ 3.x (<https://github.com/jdemetra>) time series analysis software. It provides a variety of methods for temporal disaggregation & interpolation, benchmarking, reconciliation and calendarization. It incorporates statistical methods described in the latest European Statistical System (ESS) guidelines on temporal disaggregation, benchmarking, and reconciliation (2018 edition). The package implements highly efficient algorithms for fast and reliable computation.

R implementation of the FAIR Data Pipeline API'. The FAIR Data Pipeline is intended to enable tracking of provenance of FAIR (findable, accessible and interoperable) data used in epidemiological modelling.

This package provides a collection of small text corpora of interesting data. It contains all data sets from dariusk/corpora'. Some examples: names of animals: birds, dinosaurs, dogs; foods: beer categories, pizza toppings; geography: English towns, rivers, oceans; humans: authors, US presidents, occupations; science: elements, planets; words: adjectives, verbs, proverbs, US president quotes.

This package provides algorithms to locate multiple distributional change-points in piecewise stationary time series. The algorithms are provably consistent, even in the presence of long-range dependencies. Knowledge of the number of change-points is not required. The code is written in Go and interfaced with R.

This package provides functions for detecting spatial clusters using the flexible spatial scan statistic developed by Tango and Takahashi (2005) <doi:10.1186/1476-072X-4-11>. This package implements a wrapper for the C routine used in the FleXScan 3.1.2 <https://sites.google.com/site/flexscansoftware/home> developed by Takahashi, Yokoyama, and Tango. For details, see Otani et al. (2021) <doi:10.18637/jss.v099.i13>.

Verified interval arithmetic for R, in the inf-sup (endpoint) representation of the set-based flavor of the interval standard. Every operation returns an enclosure that provably contains the exact result: outward rounding is obtained from the predecessor and successor formulas of Rump, Zimmermann, Boldo and Melquiond (2009) <doi:10.1007/s10543-009-0218-z>, which are valid under round-to-nearest and therefore need no change to the floating-point rounding mode. That mode is not reachable from R, and changing it would not be a local act: it is per-thread state of the processor, so it would govern every floating-point operation executed afterwards on that thread, in this package or anywhere else. Elementary functions are provided at two levels: a fast level over the included correctly rounded binary64 implementation, comprising fifteen kernels from CORE-MATH <doi:10.1109/ARITH54963.2022.00014> and the hardware square root, widened by the pre-registered slack of two outward steps; and a rigorous level over Rmpfr with a directed-rounding bridge, reached by an escalation ladder of precisions when a verdict would otherwise fall inside the slack. Fast-level enclosures retain measured provenance because correct rounding of the included software is verified numerically rather than established here as a theorem for every kernel. On top of the kernel the package builds natural and centered interval extensions of expressions, a monotonicity test, the Hansen-Sengupta interval Newton operator with extended division and epsilon-inflated candidate verification, and a subdivision (paving) engine whose only failure mode is a named abstention with its budget printed. Conformance with IEEE Std 1788.1-2017 <doi:10.1109/IEEESTD.2018.8277144> is not claimed, and the reason is the standard's own: its subclause 1.5 makes conformance a list of requirements that an implementation shall satisfy, with no partial grade to claim. What this package follows, measured one requirement at a time and stated in the package documentation, is the interval type and the decoration system of clause 5, 22 of the 39 arithmetic operations of Table 4.1, and the seven numeric functions of Table 4.3. What it does not provide is the cancellative operations, the interval comparison relations, the text input and output of subclause 6.8, the interchange representation of subclause 7.3, and the tightest accuracy that subclause 6.5.2 requires of the basic operations, which here are one unit in the last place wider at each end.

The minimal rrapply'-package contains a single function rrapply(), providing an extended implementation of R'-base rapply() by allowing to recursively apply a function to elements of a nested list based on a general condition function and including the possibility to prune or aggregate nested list elements from the result. In addition, special arguments can be supplied to access the name, location, parents and siblings in the nested list of the element under evaluation. The rrapply() function builds upon rapply()'s native C implementation and requires no other package dependencies.

Discretize AR(1) process following Tauchen (1986) <http://www.sciencedirect.com/science/article/pii/0165176586901680>. A discrete Markov chain that approximates in the sense of weak convergence a continuous-valued univariate Autoregressive process of first order is generated. It is a popular method used in economics and in finance.

Robust tests (RW, RPB and RGF) are provided for testing the equality of several long-tailed symmetric (LTS) means when the variances are unknown and arbitrary. RW, RPB and RGF tests are robust versions of Welch's F test proposed by Welch (1951) <doi:10.2307/2332579>, parametric bootstrap test proposed by Krishnamoorthy et. al (2007) <doi:10.1016/j.csda.2006.09.039>; and generalized F test proposed by Weerahandi (1995) <doi:10.2307/2532947>;, respectively. These tests are based on the modified maximum likelihood (MML) estimators proposed by Tiku(1967, 1968) <doi:10.2307/2333859>, <doi:10.1080/01621459.1968.11009228>.

Create presentations and display them inside the R REPL (Read-Eval-Print loop), aka the R console. Presentations can be written in RMarkdown or any other text format. A set of convenient navigation options as well as code evaluation during a presentation is provided. It is great for tech talks with live coding examples and tutorials. While this is not a replacement for standard presentation formats, it's old-school looks might just be what sets it apart. This project has been inspired by the REPLesent project for presentations in the Scala REPL'.

Symbolic Data Analysis (SDA) was proposed by professor Edwin Diday in 1987, the main purpose of SDA is to substitute the set of rows (cases) in the data table for a concept (second order statistical unit). This package implements, to the symbolic case, certain techniques of automatic classification, as well as some linear models.

The TRIM model is widely used for estimating growth and decline of animal populations based on (possibly sparsely available) count data. The current package is a reimplementation of the original TRIM software developed at Statistics Netherlands by Jeroen Pannekoek. See <https://www.cbs.nl/en-gb/society/nature-and-environment/indices-and-trends%2d%2dtrim%2d%2d> for more information about TRIM.

Autoencoding Random Forests ('RFAE') provide a method to autoencode mixed-type tabular data using Random Forests ('RF'), which involves projecting the data to a latent feature space of user-chosen dimensionality (usually a lower dimension), and then decoding the latent representations back into the input space. The encoding stage is useful for feature engineering and data visualisation tasks, akin to how principal component analysis ('PCA') is used, and the decoding stage is useful for compression and denoising tasks. At its core, RFAE is a post-processing pipeline on a trained random forest model. This means that it can accept any trained RF of ranger object type: RF', URF or ARF'. Because of this, it inherits Random Forests robust performance and capacity to seamlessly handle mixed-type tabular data. For more details, see Vu et al. (2025) <doi:10.48550/arXiv.2505.21441>.