Joining (Tree Clustering) Introductory Overview – Distance Measures

The joining or tree clustering method uses the dissimilarities or distances between objects when forming the clusters. These distances can be based on a single dimension or multiple dimensions. For example, if we were to cluster fast foods, we could take into account the number of calories they contain, their price, subjective ratings of taste, etc. The most straightforward way of computing distances between objects in a multi-dimensional space is to compute Euclidean distances. If we had a two- or three-dimensional space this measure is the actual geometric distance between objects in the space (i.e., as if measured with a ruler). However, the joining algorithm does not "care" whether the distances that are "fed" to it are actual real distances, or some other derived measure of distance that is more meaningful to the researcher; and it is up to the researcher to select the right method for his/her specific application. The Cluster Analysis module will compute various types of distance measures, or the user can compute a matrix of distances him or herself and directly use it in the procedure.

Squared Euclidean distance.

Euclidean distance.

City-block (Manhattan) distance.

Chebychev distance.

Power distance.

Percent disagreement.

This discription has been taken from the standard STATISTICA packege, Help-option.