Q-聚类的性质刻画
Characterizing Properties for Q-Clustering
摘要:
我们唯一的特点是两个成员的Q-聚类家庭的公理化框架。我们介绍的属性,使用已知的树结构的特征。为了刻画最大和聚类算法,我们使用Gomory-Hu构造,并且为了刻画单链接,我们使用最大生成树。虽然乍一看,似乎这些属性是“显然”所有必要的特点最大和单链接,我们表明,这是不是这样的,通过调查如何子集的属性相互作用。最后,我们提出了增加目前使用的聚类范式的分类。
英文摘要:
We uniquely characterize two members of the Q-Clustering family in an axiomatic framework. We introduce properties that use known tree constructions for the purpose of characterization. To characterize the Max-Sum clustering algorithm, we use the Gomory-Hu construction, and to characterize Single-Linkage, we use the Maximum Spanning Tree. Although at first glance it seems these properties are `obviously' all that are necessary to characterize Max-Sum and Single-Linkage, we show that this is not the case, by investigating how subsets of properties interact. We conclude by proposing additions to the taxonomy of clustering paradigms currently in use.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。