单连锁簇上曼哈顿与欧几里德距离的差异？ [英] difference between manhattan and euclidean distance on single linkage cluster ?
问题描述
曼哈顿与欧几里德距离计算在单个连锁簇上有什么区别？哪一个更好？我编写了一个单链接聚类程序并使用了两种距离计算，我只是看到当我想通过停止迭代来划分像5个聚类或6个聚类的聚类时，我看到聚类在相同的迭代中有不同的成员。
像这样：
为euclid
.....İTERATİON.....：39
集群0
1 7 19 33 46 47 20 27
集群1
2 8 28 34 44 17 31 5 25
群集2
3 11 12 37 39 29 42 15
群集3
4 6 14 32 41 30
集群8
9 16 35 43
Cluster 9
10 21 36
群集12
13 26 40 18 22 45 24 38
群集22
< br $> b $ b $
和曼哈顿：
.....İTERATİON.....：39
群集0
1 7 20 33 47 46 19 27
群集1
2 8 28 34 44 17 31 5 25
集群2
3 11 12 37 39 29 42 15
集群3
4 6 14 32 41 30
群集8
9 16 35 43
群集9 < br $>
10 21 36
集群12
13 26 40 18 22 45 24 38
群集22
23
what is the difference between manhattan and euclidean distances calculations on single linkage cluster ?? which one is preferable ? i wrote a program for single linkage clustering and used both distances calculations ,, i just see that when i want to divide clusters like 5 clusters or 6 clusters by stopping iterations ,, i seen clusters has different members at the same iterations.
like this :
for euclid
.....İTERATİON ..... :39
Cluster 0
1 7 19 33 46 47 20 27
Cluster 1
2 8 28 34 44 17 31 5 25
Cluster 2
3 11 12 37 39 29 42 15
Cluster 3
4 6 14 32 41 30
Cluster 8
9 16 35 43
Cluster 9
10 21 36
Cluster 12
13 26 40 18 22 45 24 38
Cluster 22
23
and for manhattan :
.....İTERATİON ..... :39
Cluster 0
1 7 20 33 47 46 19 27
Cluster 1
2 8 28 34 44 17 31 5 25
Cluster 2
3 11 12 37 39 29 42 15
Cluster 3
4 6 14 32 41 30
Cluster 8
9 16 35 43
Cluster 9
10 21 36
Cluster 12
13 26 40 18 22 45 24 38
Cluster 22
23
推荐答案
关于差异的问题是如此不正确！你能告诉我们苹果与苹果的区别吗？ :-)
你只需要学习你想要比较的两个科目。请参阅：
http://en.wikipedia.org/wiki/Cluster_analysis [< a href =http://en.wikipedia.org/wiki/Cluster_analysistarget =_ blanktitle =New Window> ^ ]，
http://en.wikipedia.org/wiki/Manhattan_distance [ ^ ]。
供参考：
< a href =http://en.wikipedia.org/wiki/Distance_function> http://en.wikipedia.org/wiki/Distance_function [ ^ ]，
http://en.wikipedia.org/wiki/Euclidean_metric [ ^ ]，
http ：//en.wikipedia.org/wiki/Euclidean_geometry [ ^ ]。
如果您仍然认为可以比较一切，请熟悉这一点：
http://en.wikipedia.org/wiki/Partially_ordered_set [ ^ ]，
http： //en.wikipedia.org/wiki/Lattice_theory [ ^ ]。
对于软件开发人员来说，这是非常有用的阅读。
-SA
The questions on "difference" are so incorrect! Can you tell us the difference between apple and Apple? :-)
You just need to learn both subjects you are trying to "compare". Please see:
http://en.wikipedia.org/wiki/Cluster_analysis[^],
http://en.wikipedia.org/wiki/Manhattan_distance[^].
And for reference:
http://en.wikipedia.org/wiki/Distance_function[^],
http://en.wikipedia.org/wiki/Euclidean_metric[^],
http://en.wikipedia.org/wiki/Euclidean_geometry[^].
If you still think that everything could be compared, get familiar with this:
http://en.wikipedia.org/wiki/Partially_ordered_set[^],
http://en.wikipedia.org/wiki/Lattice_theory[^].
For a software developer, this is very useful reading.
—SA
这就是为什么我问它，哪一个更合适？
that''s why i asked it ,, which one is more preferable ?
这篇关于单连锁簇上曼哈顿与欧几里德距离的差异？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！
