ULTRAMETRIC HIERARCHICAL CLUSTERING ALGORITHMS

被引:58
作者
MILLIGAN, GW
机构
[1] Faculty of Management Sciences, The Ohio State University, Columbus, 43210, Ohio
关键词
D O I
10.1007/BF02294699
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Johnson has shown that the single linkage and the complete linkage hierarchical clustering algorithms induce a metric on the data known as the ultrametric. Through the use of the Lance and Williams recurrence formula, Johnson's proof is extended to four other common clustering algorithms. It is also noted that two additional methods produce hierarchical structures which can violate the ultrametric inequality. © 1979 The Psychometric Society.
引用
收藏
页码:343 / 346
页数:4
相关论文
共 9 条