To solve the inefficiency problem of traditional PAM algorithm for initial cluster center,a new improved PAM algorithm is *** algorithm builds minimum spanning tree and then splits it to get k initial clusters with th...
详细信息
To solve the inefficiency problem of traditional PAM algorithm for initial cluster center,a new improved PAM algorithm is *** algorithm builds minimum spanning tree and then splits it to get k initial clusters with the relevant cluster *** analysis and experimental results show that the found initial centers are closed to the desired cluster centers,and the improved algorithm can achieve stable clustering results and higher cluster clustering accuracy.
暂无评论