The absolute distance between two n-length vectors of cluster fill rates, a
and b, is a vector of the same length as a and b. It can be calculated as
abs(a-b) where subtraction is performed element-wise, then the absolute
value of each element is returned. More specifically, element i of the vector is \(|a_i
- b_i|\) for \(i=1,2,...,n\).
The Manhattan distance between two n-length vectors of cluster fill rates, a and b, is
\(\sum_{i=1}^n |a_i - b_i|\). In other words, it is the sum of the absolute
distance vector.
The Euclidean distance between two n-length vectors of cluster fill rates, a and b, is
\(\sqrt{\sum_{i=1}^n (a_i - b_i)^2}\). In other words, it is the sum of the elements of the
absolute distance vector.
The maximum distance between two n-length vectors of cluster fill rates, a and b, is
\(\max_{1 \leq i \leq n}{\{|a_i - b_i|\}}\). In other words, it is the sum of the elements of the
absolute distance vector.
The cosine distance between two n-length vectors of cluster fill rates, a and b, is
\(\sum_{i=1}^n (a_i - b_i)^2 / (\sqrt{\sum_{i=1}^n a_i^2}\sqrt{\sum_{i=1}^n b_i^2})\).