OPHCLUS:基于序关系保持的层次聚类算法

引入序关系保持的思想,即层次聚类的簇间距离度量应该能够最大限度地维护样本点间的原始距离排序关系。定义了样本点对序关系的概念和序关系损失度量,证明了序关系损失度量可用做聚类的目标准则函数和聚类结果质量的评价标准。利用序关系损失的概念扩展出两种簇间距离度量,实现了基于序关系保持的层次聚类算法(order-preserving based hierarchical clustering algorithm, OPHCLUS)。实验仿真证明了OPHCLUS对聚类质量提升的有效性。

OPHCLUS:An order-preserving based hierarchical clustering algorithm

The idea of maintaining order relation was proposed, i.e.,the original order of distance between samples should be preserved by the inter-cluster measurement of hierarchical clustering as far as possible. Based on this idea, we defined the notion of order relation of sample’s pair and the loss measurement of order relation, which could be used as the objective criteria function of clustering and the validity standard of consequent clusters. Furthermore, we extended two kinds of distance measurement from the loss of order relation, i.e.,inter-cluster adjusted distance and inter-cluster 0-1 weighted distance; implemented an order-preserving based hierarchical clustering algorithm by using these two measurements. The experiment simulation demonstrated the improvement in the clustering quality.