This package provides Gaussian mixture models, k-means, mini-batch-kmeans, k-medoids and affinity propagation clustering with the option to plot, validate, predict (new data) and estimate the optimal number of clusters. The package takes advantage of RcppArmadillo to speed up the computationally intensive parts of the functions. For more information, see

1. "Clustering in an Object-Oriented Environment" by Anja Struyf, Mia Hubert, Peter Rousseeuw (1997), Journal of Statistical Software, https://doi.org/10.18637/jss.v001.i04;

2. "Web-scale k-means clustering" by D. Sculley (2010), ACM Digital Library, https://doi.org/10.1145/1772690.1772862;

3. "Armadillo: a template-based C++ library for linear algebra" by Sanderson et al (2016), The Journal of Open Source Software, https://doi.org/10.21105/joss.00026;

4. "Clustering by Passing Messages Between Data Points" by Brendan J. Frey and Delbert Dueck, Science 16 Feb 2007: Vol. 315, Issue 5814, pp. 972-976, https://doi.org/10.1126/science.1136800.

Biterm Topic Models find topics in collections of short texts. It is a word co-occurrence based topic model that learns topics by modeling word-word co-occurrences patterns which are called biterms. This in contrast to traditional topic models like Latent Dirichlet Allocation and Probabilistic Latent Semantic Analysis which are word-document co-occurrence topic models. A biterm consists of two words co-occurring in the same short text window. This context window can for example be a twitter message, a short answer on a survey, a sentence of a text or a document identifier. The techniques are explained in detail in the paper 'A Biterm Topic Model For Short Text' by Xiaohui Yan, Jiafeng Guo, Yanyan Lan, Xueqi Cheng (2013) https://github.com/xiaohuiyan/xiaohuiyan.github.io/blob/master/paper/BTM-WWW13.pdf.

This package provides a differential evolution (DE) stochastic algorithms for global optimization of problems with and without constraints. The aim is to curate a collection of its state-of-the-art variants that

1. do not sacrifice simplicity of design,

2. are essentially tuning-free, and

3. can be efficiently implemented directly in the R language.

This package provides methods that simplify the setup of S3 generic functions and S3 methods. Major effort has been made in making definition of methods as simple as possible with a minimum of maintenance for package developers. For example, generic functions are created automatically, if missing, and naming conflict are automatically solved, if possible. The method setMethodS3() is a good start for those who in the future may want to migrate to S4.

This is package for QTL mapping in a mixed model framework with separate detection and localization stages. The first stage detects the number of QTL on each chromosome based on the genetic variation due to grouped markers on the chromosome; the second stage uses this information to determine the most likely QTL positions. The mixed model can accommodate general fixed and random effects, including spatial effects in field trials and pedigree effects. It is applicable to backcrosses, doubled haploids, recombinant inbred lines, F2 intercrosses, and association mapping populations.

The true random number service provided by the random.org website created by Mads Haahr samples atmospheric noise via radio tuned to an unused broadcasting frequency together with a skew correction algorithm due to John von Neumann. More background is available in the included vignette based on an essay by Mads Haahr. In its current form, the package offers functions to retrieve random integers, randomized sequences and random strings.

This package Provides a variety of functions for producing simple weighted statistics, such as weighted Pearson's correlations, partial correlations, Chi-Squared statistics, histograms, and t-tests. Also now includes some software for quickly recoding survey data and plotting point estimates from interaction terms in regressions (and multiply imputed regressions). NOTE: Weighted partial correlation calculations pulled to address a bug.

This package estimates optimal cutpoints for binary classification metrics. It also validates performance using bootstrapping. Some methods for more robust cutpoint estimation are supported, e.g. a parametric method assuming normal distributions, bootstrapped cutpoints, and smoothing of the metric values per cutpoint using Generalized Additive Models. Various plotting functions are included.

This package parses HTTP request data in application/json, multipart/form-data, or application/x-www-form-urlencoded format. It includes an example of hosting and parsing HTML form data in R using either httpuv or Rhttpd.

This package extends the out of memory vectors of ff with statistical functions and other utilities to ease their usage.

The main purpose of this package is to provide the algorithmic complexity for short strings, an approximation of the Kolmogorov Complexity of a short string using the coding theorem method. While the database containing the complexity is provided in the data only package acss.data, this package provides functions accessing the data such as prob_random returning the posterior probability that a given string was produced by a random process. In addition, two traditional (but problematic) measures of complexity are also provided: entropy and change complexity.

This package provides data sets used for demonstrating or testing model-related packages.

This package provides a graph implementation that can be thought of as two tidy data frames describing node and edge data respectively. It provides an approach to manipulate these two virtual data frames using the API defined in the dplyr package, and it also provides tidy interfaces to a lot of common graph algorithms.

The httpuv package provides low-level socket and protocol support for handling HTTP and WebSocket requests directly from within R. It is primarily intended as a building block for other packages, rather than making it particularly easy to create complete web applications using httpuv alone.

This package provides simple and secure authentication mechanism for single Shiny applications. Credentials are stored in an encrypted SQLite database.

This package provides functions for plotting graphical shapes such as ellipses, circles, cylinders, arrows, ...

This package provides a forest plot that allows for multiple confidence intervals per row, custom fonts for each text element, custom confidence intervals, text mixed with expressions, and more. The aim is to extend the use of forest plots beyond meta-analyses. This is a more general version of the original rmeta package's forestplot() function and relies heavily on the grid package.

This package provides a wrapper for the Intro.js library. This package makes it easy to include step-by-step introductions, and clickable hints in a Shiny application. It supports both static introductions in the UI, and programmatic introductions from the server-side.

This package lets you rarefy data, calculate diversity and plot the results.

This package contains the function ggsurvplot() for easily drawing beautiful and 'ready-to-publish' survival curves with the 'number at risk' table and 'censoring count plot'. Other functions are also available to plot adjusted curves for Cox model and to visually examine Cox model assumptions.

This package provides a cross-platform solution to open files, directories or URLs with their associated programs.

This package provides functions related to human natural ordering. It handles adjacent digits in a character sequence as a number so that natural sort function arranges a character vector by their numbers, not digit characters.

This package provides functions for Meta-analysis Burden Test, Sequence Kernel Association Test (SKAT) and Optimal SKAT (SKAT-O) by Lee et al. (2013) <doi:10.1016/j.ajhg.2013.05.010>. These methods use summary-level score statistics to carry out gene-based meta-analysis for rare variants.

This package extends sparse matrix and vector classes from the Matrix package by providing:

1. Methods and operators that work natively on CSR formats (compressed sparse row, a.k.a. RsparseMatrix) such as slicing/sub-setting, assignment, rbind(), mathematical operators for CSR and COO such as addition or sqrt(), and methods such as diag();

2. Multi-threaded matrix multiplication and cross-product for many <sparse, dense> types, including the float32 type from float;

3. Coercion methods between pairs of classes which are not present in Matrix, such as from dgCMatrix to ngRMatrix, as well as convenience conversion functions;

4. Utility functions for sparse matrices such as sorting the indices or removing zero-valued entries;

5. Fast transposes that work by outputting in the opposite storage format;

6. Faster replacements for many Matrix methods for all sparse types, such as slicing and elementwise multiplication.

7. Convenience functions for sparse objects, such as mapSparse or a shorter show method.