We propose the use of projection correlation to characterize dependence between two random vectors. Projection correlation has several appealing properties. It equals zero if and only if the two ...

Similarity search is based on finding the distance between two vectors and retrieving the closest. The vectors are numerical representations of words or phrases.

Briefly, vector search is based on calculating the distance between two vectors and applying an algorithm to find nearest vectors, such as K Nearest Neighbors and Approximate Neighbor Search.

In model-based clustering, the relevant distance measurement is called the Mahalanobis distance, which is the Euclidean distance scaled by the covariance between vectors 16.