# Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.

### Special Cases of Minkowski Distance

*h*= 1: Manhattan (city block, L1 norm) distance- E.g., the Hamming distance: the number of bits that are different between two binary vectors

*h*= 2: (L2 norm) Euclidean distance

\[ d(i,j)=\sqrt{(|x_{i1}-x_{j1}|^2+|x_{i2}-x_{j2}|^2+...+|x_{ip}-x_{jp}|^2)} \]

*h →≈*. “supremum” (Lmax norm, L*≈*norm) distance.- This is the maximum difference between any component (attribute) of the vectors

**Speaker notes:**

## Content Tools

Tools

Sources (0)

Tags (0)

Comments (0)

History

Usage

Questions (0)

Playlists (0)

Quality

### Sources

There are currently no sources for this slide.