.rst .pdf

Contents

Minkowski distance

The Minkowski distances are the set of distance metrics with different degree $(p>0)$ and are widely used for distance computation in different algorithms. The most commonly used distance metric, Euclidean distance, is also a Minkowski distance with $p=2.0$.

Operation	Computational methods
dense	dense

Mathematical formulation

Computing

Given a set $U$ of $n$ feature vectors $u_1=(u_{11},\dots ,u_{1k}),\dots ,u_n=(u_{n1},\dots ,u_{nk})$ of dimension $k$ and a set $V$ of $m$ feature vectors $v_1=(v_{11},\dots ,v_{1k}),\dots ,v_m=(v_{m1},\dots ,v_{mk})$ of dimension $k$, the problem is to compute the Minkowski distance $||u_i,v_j|{|}_p$ for any pair of input vectors:

$$||u_i,v_j|{|}_p=\sum _{l=1}^k{({|u_{il}-v_{jl}|}^p)}^{1/p},$$

where $1\le i\le n,1\le j\le m,p>0$.

Computation method: dense

The method defines Minkowski distance metric, which is used in other algorithms for the distance computation. There are no separate computation mode to compute distance manually.

Programming Interface

Refer to API Reference: Minkowski distance.

previous

Pairwise Distances

next

Chebyshev distance