Ensemble model, for classification, regression
	and unsupervised learning, based on a forest of unpruned 
	and randomized binary decision trees. Each tree is grown 
	by sampling, with replacement, a set of variables at each node. 
	Each cut-point is generated randomly, according to the continuous 
	Uniform distribution. For each tree, data are either bootstrapped 
	or subsampled. The unsupervised mode introduces clustering, dimension reduction
	and variable importance, using a three-layer engine. Random Uniform Forests are mainly 
	aimed to lower correlation between trees (or trees residuals), to provide a deep analysis 
	of variable importance and to allow native distributed and incremental learning.

Based on data of real user-agent strings, we can set filtering conditions
    and randomly sample user-agent strings from the user-agent string pool.

Generates random walks of various types by providing a set of functions
    that are compatible with the 'tidyverse'. The functions provided in the package
    make it simple to create random walks with a variety of properties, such as
    how many simulations to run, how many steps to take, and the distribution of
    random walk itself.

Randomization lists are an integral component of randomized clinical trials. 'randotools' provides tools to easily create such lists.

Carry out principal component analysis (PCA) of very large pedigrees such as found
    in breeding populations! This package exploits sparse matrices and randomised
    linear algebra to deliver a gazillion-times speed-up compared to naive singular value decoposition (SVD)
    (and eigen decomposition).

Performs random projection using Johnson-Lindenstrauss (JL) Lemma (see William B.Johnson and Joram Lindenstrauss (1984) <doi:10.1090/conm/026/737400>). Random Projection is a dimension reduction technique, where the data in the high dimensional space is projected into the low dimensional space using JL transform. The original high dimensional data matrix is multiplied with the low dimensional projection matrix which results in reduced matrix. The projection matrix can be generated using the projection function that is independent to the original data. Then finally apply the classification task on the projected data.