It is just a distance measure between a pair of samples p and q in an n-dimensional feature space:

For example, picture it as a “straight, connecting” line in a 2D feature space:

The Euclidean is often the “default” distance used in e.g., K-nearest neighbors (classification) or K-means (clustering) to find the “k closest points” of a particular sample point. Another prominent example is hierarchical clustering, agglomerative clustering (complete and single linkage) where you want to find the distance between clusters.



If you like this content and you are looking for similar, more polished Q & A’s, check out my new book Machine Learning Q and AI.