期刊文献+

一种新的聚类算法:等密度线算法 被引量:14

DILC: A Clustering Algorithm Based on Density-isoline
下载PDF
导出
摘要 提出了一种新的聚类算法 :等密度线聚类算法 .该算法从样本分布等密度线图的思想出发 ,从图中找出样本分布比较集中的区域 ,从而发现隐含在样本集中的类 .等密度线聚类算法不需要输入任何参数 ,是一种无监督式聚类 .它能够自动发现任意形状的类 ,并且能有效地排除噪声干扰 .实验结果表明 ,等密度线聚类算法具有较快的聚类速度和较好的聚类效果 . A clustering algorithm, density-isoline clustering (DILC) algorithm is put forward. DILC starts from the density-isoline figure of samples, and finds relatively dense regions, which are clusters. DILC is capable of eliminating outliers and discovering clusters of various shapes. It is an unsupervised clustering algorithm because it requires no interaction. The high accuracy and efficiency of DILC clustering algorithm are shown in our experiments.
出处 《北京邮电大学学报》 EI CAS CSCD 北大核心 2002年第2期8-13,共6页 Journal of Beijing University of Posts and Telecommunications
关键词 聚类算法 数据挖掘 等密度线聚类 Algorithms Computer simulation
  • 相关文献

参考文献5

  • 1[1]Alsabti K,Ranka S,Singh V.An efficient k-means clustering algorithm[C].IPPS-98,Proceedings of the First Workshop on High Performance Date Mining,Orlando,Florida,USA,1998.
  • 2[2]Bradley P S,Mangasarian L.k-plane Clustering[J].Journal of Global Optimization,2000,16(1):23-32.
  • 3[3]Zhang T,Ramakrishnan R,Livny M.BIRCH: an efficient data clustering method for very large databases[A].Proceedings of 1996 ACM-SIGMOD Int.Conf.on Management of Data[C].Montreal,Quebec:1996.
  • 4[4]Jain Anil K.Algorithms for Clustering Data[M].Prentice Hall,1998.
  • 5[5]Ester M,Kriegel H P,Sander J,et al.A density-based algorithm for discovering clusters in large spatial databases with noise[C].Proceedings of the 2nd Int.Conf.on Knowledge Discovery and Data Mining,Portland,Dregon,1996.

同被引文献120

引证文献14

二级引证文献214

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部