首页 > 其他 > 详细

clustering algorithms

时间:2015-05-07 20:16:56      阅读:108      评论:0      收藏:0      [点我收藏+]

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

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!