Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms
Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms
复制标题
DOI：
10.1007/s00357-008-9004-x
复制
发表时间：
2008-06-01
影响因子：
2
通讯作者：
Gomez, Sergio
中科院分区：
文献类型：
--
作者：
Fernandez, Alberto;Gomez, Sergio
在凝聚层次聚类中，当不同聚类之间的两个或多个距离在合并过程中重合时，对组方法遭受非唯一性问题。解决这一缺陷的传统方法是采用任意标准来打破距离之间的联系，这导致根据所遵循的标准进行不同的层次分类。在这篇文章中，我们提出了一个变量组算法，包括在分组两个以上的集群在同一时间，当领带发生。我们给出了一个树表示的算法，我们称之为一个多树状图的结果，以及一个推广的兰斯和威廉姆斯的公式，使算法的实施递归的方式。
In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters coincide during the amalgamation process. The traditional approach for solving this drawback has been to take any arbitrary criterion in order to break ties between distances, which results in different hierarchical classifications depending on the criterion followed. In this article we propose a variable-group algorithm that consists in grouping more than two clusters at the same time when ties occur. We give a tree representation for the results of the algorithm, which we call a multidendrogram, as well as a generalization of the Lance and Williams' formula which enables the implementation of the algorithm in a recursive way.