作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (12): 58-60. doi: 10.3969/j.issn.1000-3428.2010.12.020

• 软件技术与数据库 • 上一篇    下一篇

基于中心距序降维的聚类算法

向剑平1,2,唐常杰2,郑皎凌2,易树鸿1   

  1. (1. 遵义师范学院计算机科学系,遵义 563000;2. 四川大学计算机学院,成都 610065)
  • 出版日期:2010-06-20 发布日期:2010-06-20
  • 作者简介:向剑平(1958-),女,副教授,主研方向:数据挖掘,知识发现;唐常杰,教授、博士生导师;郑皎凌,博士;易树鸿,教授
  • 基金资助:

    国家自然科学基金资助项目(60773169);贵州省科技厅自然科学基金资助项目(黔科合J字[2010]);遵义市科技局自然科学基金资助项目(遵市科合社字[2009]27号)

Clustering Algorithm Based on Dimension Reduction by Center Distance Order

XIANG Jian-ping1,2, TANG Chang-jie2, ZHENG Jiao-ling2, YI Shu-hong1   

  1. (1. Department of Computer Science, Zunyi Normal College, Zunyi 563000; 2. School of Computer Science, Sichuan University, Chengdu 610065)
  • Online:2010-06-20 Published:2010-06-20

摘要:

为提高金融业务数据集上的聚类质量和聚类效率,提出簇的直径、簇间的相似度这2个概念。利用距离尺度降维的中心距序降维法,将多维数据降至一维,在一维上利用自适应排序聚类算法ASC聚类。该算法和传统的Cobweb算法、K-means算法做对比,实验表明该方法能提高簇间相似度,最大提高200%。

关键词: 簇直径, 簇间相似度, ASC算法, 中心距序降维

Abstract:

Aiming to improve the clustering quality and efficiency on banking services datasets, this paper proposes the concepts of cluster diameter and the similarity measurement between clusters. It modifies multi-dimensional data to one dimension by dimension reduction based on distance order. It clusters the one dimension data with a self-Adaptive Sort Clustering(ASC) algorithm. This paper conducts extensive experiments to show that this algorithm can improve the cluster similarity and reduce the clustering time compared with Cobweb and K-means algorithms. The cluster similarity can be approximately improved by 200%.

Key words: cluster diameter, cluster similarity, self-Adaptive Sort Clustering(ASC) algorithm, dimension reduction by center distance order

中图分类号: