Contains procedures for depth-based supervised learning, which are entirely non-parametric, in particular the DDalpha-procedure (Lange, Mosler and Mozharovskyi, 2014 <doi:10.1007/s00362-012-0488-4>). The training data sample is transformed by a statistical depth function to a compact low-dimensional space, where the final classification is done. It also offers an extension to functional data and routines for calculating certain notions of statistical depth functions. 50 multivariate and 5 functional classification problems are included. (Pokotylo, Mozharovskyi and Dyckerhoff, 2019 <doi:10.18637/jss.v091.i05>).

A distance density clustering (DDC) algorithm in R. DDC uses dynamic time warping (DTW) to compute a similarity matrix, based on which cluster centers and cluster assignments are found. DDC inherits dynamic time warping (DTW) arguments and constraints. The cluster centers are centroid points that are calculated using the DTW Barycenter Averaging (DBA) algorithm. The clustering process is divisive. At each iteration, cluster centers are updated and data is reassigned to cluster centers. Early stopping is possible. The output includes cluster centers and clustering assignment, as described in the paper (Ma et al (2017) <doi:10.1109/ICDMW.2017.11>).

Implements maximum likelihood and bootstrap methods based on
 the diversity-dependent birth-death process to test whether
 speciation or extinction are diversity-dependent, under various
 models including various types of key innovations.
 See Etienne et al. 2012, Proc. Roy. Soc. B 279: 1300-1309,
 <DOI:10.1098/rspb.2011.1439>,
 Etienne & Haegeman 2012, Am. Nat. 180: E75-E89,
 <DOI:10.1086/667574>,
 Etienne et al. 2016. Meth. Ecol. Evol. 7: 1092-1099,
 <DOI:10.1111/2041-210X.12565> and
 Laudanno et al. 2021. Syst. Biol. 70: 389–407,
 <DOI:10.1093/sysbio/syaa048>.
 Also contains functions to simulate the diversity-dependent
 process.

Solves ordinary and delay differential equations, where
    the objective function is written in either R or C.  Suitable only
    for non-stiff equations, the solver uses a 'Dormand-Prince' method
    that allows interpolation of the solution at any point.  This
    approach is as described by Hairer, Norsett and Wanner (1993)
    <ISBN:3540604529>.  Support is also included for iterating
    difference equations.