clustering algorithms

标签：

Definition of distance between data:

　(1) Hamming Distance: d(i,j)=sum(abs(x(i,k)-x(j,k))) | k from 1 to m

　(2) Euclid Distance: d(i,j)=sum((x(i,k)-x(j,k))^2)  | k from 1 to m

　(3) Mahalanobis Distance: Eliminiate the units of each vector.

Non-distance methods:

　(1)

To be continued...

clustering algorithms

标签：

原文地址：http://www.cnblogs.com/jast/p/4485866.html