计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (31): 175-177.

• 数据库与信息处理 • 上一篇    下一篇

一种基于划分的层次聚类算法

沈 洁1,赵 雷1,2,杨季文1,李 榕1   

  1. 1.苏州大学 计算机科学与技术学院,江苏 苏州 215006
    2.苏州大学 江苏省计算机信息处理技术重点实验室,江苏 苏州 215006
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-11-01 发布日期:2007-11-01
  • 通讯作者: 沈 洁

Hierarchical clustering algorithm based on partition

SHEN Jie1,ZHAO Lei1,2,YANG Ji-wen1,LI Rong1   

  1. 1.School of Computer Science and Technology,Soochow University,Suzhou,Jiangsu 215006,China
    2.Jiangsu Provincial Key Lab. of Computer Information Processing Technology,Soochow University,Suzhou,Jiangsu 215006,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-11-01 Published:2007-11-01
  • Contact: SHEN Jie

摘要: CURE算法是针对大规模数据聚类算法的典型代表。提出了一种新的算法K-CURE,该方法基于划分思想对CURE算法作了改进,同时给出了在聚类中剔除孤立点的时机选择方法。测试表明,改进后的算法效率明显高于原算法,且聚类效果良好。

Abstract: CURE is a typical clustering algorithm that is designed for the mining of mass data.A new algorithm K-CURE is introduced in this article to improve the CURE based on partition.A method is also described to explain how to choose the occasion of eliminating outlier during clustering.Experiments indicate that the improved algorithm does improve the CURE in both efficiency and effectiveness.