Standard agglomerative clustering suggests establishing a new reliable linkage at every step. However, in order to provide adaptive, density-consistent and flexible solutions, we study extracting all the reliable linkages at each step, instead of the smallest one. Such a strategy can be applied with all common criteria for agglomerative hierarchical clustering. We also study that this strategy with the single linkage criterion yields a minimum spanning tree algorithm. We perform experiments on several real-world datasets to demonstrate the performance of this strategy compared to the standard alternative.

翻译：标准聚居群意味着在每一个步骤都建立新的可靠的联系。然而,为了提供适应性、密度一致和灵活的解决方案,我们研究每个步骤,而不是最小的一步,提取所有可靠的联系。这种战略可以适用于聚居层的所有共同标准。我们还研究,这一战略采用单一联系标准,可以产生一个最小的跨树算法。我们在几个真实世界的数据集上进行了实验,以证明这一战略相对于标准替代方法的绩效。