1026
Comment:

← Revision 15 as of 20130308 10:17:55 ⇥
2033
converted to 1.6 markup

Deletions are marked like this.  Additions are marked like this. 
Line 1:  Line 1: 
= What is Euclidean distance and how do I compute it ? =  
Line 2:  Line 3: 
= What is the formula for Euclidean distance ? =  Euclidean distance measures the distance between two vectors of length t denoting t traits of various observations and is a specific example of Mahalanobis distance with an identity covariance matrix (ie uncorrelated traits). 
Line 4:  Line 5: 
Euclidean distance measures the distance between two vectors of length p denoting p traits of various observations and is a specific example of Mahalanobis distance with an identity covariance matrix (ie uncorrelated traits). ED = for vectors, observations with vectors $$x_text{i} = (x_text{1i}, ..., x_text_{pi})^text{T}$$ and $$x_text{j} = (x_text{1j}, ..., x_text_{pj})^text{T}$$ equals $$ \sqrt{x_text{i}  x_text{j})^text{T)(x_text{i}  x_text{j})}$$ 
ED = for vectors, observations with vectors $$x_text{i} = (x_text{1i}, ..., x_text{ti})^text{T}$$ and $$x_text{j} = (x_text{1j}, ..., x_text{tj})^text{T}$$ equals $$ \sqrt{(x_text{i}  x_text{j})^text{T}(x_text{i}  x_text{j})}$$ 
Line 9:  Line 8: 
$$ \sqrt{(x_text{1i}x_text{1j})^text{2} + .. + (x_text{pi}x_text{pj})^text{2}}$$  $$ \sqrt{(x_text{1i}x_text{1j})^text{2} + .. + (x_text{ti}x_text{tj})^text{2}}$$ 
Line 11:  Line 10: 
The Euclidean distance is the distance on a graph between two points. This is easily seen in two dimensions since by Pythagoras's theorem the distance (hypoteneuse) between two points (x11, x21) and (x12, x22) equals the square root of the squared difference in x and y coordinates = square root of (x11x12)(x11x12) + (x21x22)(x22x21). See [attachment:euclide.bmp here.] 
The Euclidean distance is the distance on a graph between two points. This is easily seen in two dimensions since by Pythagoras's theorem the linear distance (hypotenuse) between two points (x11, x21) and (x12, x22) equals the square root of the squared difference in x and y coordinates = square root of (x11x12)(x11x12) + (x21x22)(x22x21). See [[attachment:euclide.bmphere.]] 
Line 14:  Line 12: 
The Euclidean distance is a special case of Mahalanobis distance which is used for measuring multivariate group distances or [[FAQ/mahal distance of an observation from its group means]] ie with 2 or more predictors. In particular it is the square root of the Mahalanobis distance, termed D^2 in Tabachnick and Fidell (2007), with the covariance matrix replaced by the identity matrix. D^2 is defined in, for example, Campbell, Donner and Webster (1991). The Mahalanobis distance can be thought of as a multivariate extension of the square of the z value (where z is the difference in a pair of group means divided by the pooled group standard deviation). It follows that the Euclidean distance is equal to D using the identity matrix. __References__ Campbell MK, Donner, A and Webster, KM (1991) Are ordinal models useful for classification? ''Statistics in Medicine'' '''10''' 383394. Tabachnick BG and Fidell LS (2007) Using multivariate statistics. Pearson International:Boston. 
What is Euclidean distance and how do I compute it ?
Euclidean distance measures the distance between two vectors of length t denoting t traits of various observations and is a specific example of Mahalanobis distance with an identity covariance matrix (ie uncorrelated traits).
ED = for vectors, observations with vectors $$x_text{i} = (x_text{1i}, ..., x_text{ti})^{text{T}$$ and $$x_text{j} = (x_text{1j}, ..., x_text{tj})}text{T}$$ equals $$ \sqrt{(x_text{i}  x_text{j})^text{T}(x_text{i}  x_text{j})}$$
This can be written in long hand as $$ \sqrt{(x_text{1i}x_text{1j})^{text{2} + .. + (x_text{ti}x_text{tj})}text{2}}$$
The Euclidean distance is the distance on a graph between two points. This is easily seen in two dimensions since by Pythagoras's theorem the linear distance (hypotenuse) between two points (x11, x21) and (x12, x22) equals the square root of the squared difference in x and y coordinates = square root of (x11x12)(x11x12) + (x21x22)(x22x21). See here.
The Euclidean distance is a special case of Mahalanobis distance which is used for measuring multivariate group distances or distance of an observation from its group means ie with 2 or more predictors. In particular it is the square root of the Mahalanobis distance, termed D^{2 in Tabachnick and Fidell (2007), with the covariance matrix replaced by the identity matrix. D}2 is defined in, for example, Campbell, Donner and Webster (1991). The Mahalanobis distance can be thought of as a multivariate extension of the square of the z value (where z is the difference in a pair of group means divided by the pooled group standard deviation). It follows that the Euclidean distance is equal to D using the identity matrix.
References
Campbell MK, Donner, A and Webster, KM (1991) Are ordinal models useful for classification? Statistics in Medicine 10 383394.
Tabachnick BG and Fidell LS (2007) Using multivariate statistics. Pearson International:Boston.