Clustering with Prim’s sequential representation of minimum spanning tree

作者：

Highlights：

• We investigate MST-based algorithms aiming to detect three types of clusters.

• An inconsistent edge is found to dominate two subtrees at its two end vertices.

• Prim’s sequential representation of MST is proposed and studied.

• Two PSR-MST based clustering schemes are developed.

• Experiments on some data sets show their effectiveness and efficiency.

摘要

•We investigate MST-based algorithms aiming to detect three types of clusters.•An inconsistent edge is found to dominate two subtrees at its two end vertices.•Prim’s sequential representation of MST is proposed and studied.•Two PSR-MST based clustering schemes are developed.•Experiments on some data sets show their effectiveness and efficiency.

论文关键词：Clustering,Minimum spanning tree,Prim’s sequential representation,Graph partition,Inconsistent edge

论文评审过程：Available online 28 September 2014.

论文官网地址：https://doi.org/10.1016/j.amc.2014.09.026