Learn R Programming

distanceHD (version 1.2)

Distance Metrics for High-Dimensional Clustering

Description

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.

Copy Link

Version

Install

install.packages('distanceHD')

Monthly Downloads

133

Version

1.2

License

GPL (>= 2)

Maintainer

Jung Ae Lee

Last Published

January 31st, 2025

Functions in distanceHD (1.2)

dist_mdp

Maximal data piling (MDP) distance between two groups
dist_cen

Centroid distance between two groups
distanceHD-package

Distance Metrics for High-Dimensional Clustering
dist_mah

ridge Mahalanobis distance between two groups
leukemia

Gene expression data from Golub et al. (1999)