This is a Neural Network regression model implementation using 'Keras', consisting of 10 Long Short-Term Memory layers that are fully connected along with the rest of the inputs.

Linear dimension reduction subspaces can be uniquely defined using orthogonal projection matrices. This package provides tools to compute distances between such subspaces and to compute the average subspace. For details see Liski, E.Nordhausen K., Oja H., Ruiz-Gazen A. (2016) Combining Linear Dimension Reduction Subspaces <doi:10.1007/978-81-322-3643-6_7>.

Estimate haplotypic or composite pairwise linkage disequilibrium
    (LD) in polyploids, using either genotypes or genotype likelihoods. 
    Support is provided to estimate the popular measures of LD: the LD 
    coefficient D, the standardized LD coefficient D', and the Pearson 
    correlation coefficient r. All estimates are returned with corresponding 
    standard errors. These estimates and standard errors can then be used
    for shrinkage estimation. The main functions are ldfast(), ldest(), mldest(),
    sldest(), plot.lddf(), format_lddf(), and ldshrink(). Details of the methods
    are available in Gerard (2021a) <doi:10.1111/1755-0998.13349>
    and Gerard (2021b) <doi:10.1038/s41437-021-00462-5>.

Methods and tools for model selection and multi-model inference (Burnham and Anderson (2002) <doi:10.1007/b97636>, among others). 
             'SUR' (for parameter estimation), 'logit'/'probit' (for binary classification), and 'VARMA' (for time-series forecasting) are implemented.
             Evaluations are both in-sample and out-of-sample. 
             It is designed to be efficient in terms of CPU usage and memory consumption.

The leader clustering algorithm provides
 a means for clustering a set of data points. Unlike many other clustering
 algorithms it does not require the user to specify the number of clusters,
 but instead requires the approximate radius of a cluster as its primary
 tuning parameter. The package provides a fast implementation of this
 algorithm in n-dimensions using Lp-distances (with special cases for p=1,2,
 and infinity) as well as for spatial data using the Haversine
 formula, which takes latitude/longitude pairs as inputs and clusters
 based on great circle distances.