Calculate multiple or pairwise dissimilarity for orders q = 0-N 
    (CqN; Chao et al. 2008 <doi:10/fcvn63>) for a set of species assemblages or 
    interaction networks.

Spatial downscaling of coarse grid mapping to fine grid
    mapping using predictive covariates and a model fitted using the 'caret'
    package. The original dissever algorithm was published by Malone et al. 
    (2012) <doi:10.1016/j.cageo.2011.08.021>, and extended by Roudier et al.
    (2017) <doi:10.1016/j.compag.2017.08.021>.

Efficiently creates, manipulates, and subsets "dist" objects, commonly used in cluster analysis. Designed to minimise unnecessary conversions and computational overhead while enabling seamless interaction with distance matrices.

Tools to fit sample selection models in case of discrete response 
  variables, through a parametric formulation which represents a natural 
  extension of the well-known Heckman selection model are provided in the 
  package. The response variable can be of Bernoulli, Poisson or Negative 
  Binomial type. The sample selection mechanism allows to choose among a 
  Normal, Logistic or Gumbel distribution.

A simple way of fitting detection functions to distance sampling
    data for both line and point transects. Adjustment term selection, left and
    right truncation as well as monotonicity constraints and binning are
    supported. Abundance and density estimates can also be calculated (via a
    Horvitz-Thompson-like estimator) if survey area information is provided. See
    Miller et al. (2019) <doi:10.18637/jss.v089.i01> for more information on
    methods and <https://distancesampling.org/resources/vignettes.html> for example analyses.

We provide three distance metrics for measuring the separation between two clusters in high-dimensional spaces. The first metric is the centroid distance, which calculates the Euclidean distance between the centers of the two groups. The second is a ridge Mahalanobis distance, which incorporates a ridge correction constant, alpha, to ensure that the covariance matrix is invertible. The third metric is the maximal data piling distance, which computes the orthogonal distance between the affine spaces spanned by each class. These three distances are asymptotically interconnected and are applicable in tasks such as discrimination, clustering, and outlier detection in high-dimensional settings.