| 基于代表点的快速聚类算法 |
| |
| 引用本文： | 贾瑞玉,耿锦威,宁再早,何成刚.基于代表点的快速聚类算法[J].计算机工程与应用,2010,46(33):121-123. |
| |
| 作者姓名： | 贾瑞玉 耿锦威 宁再早 何成刚 |
| |
| 作者单位： | 安徽大学,计算机科学与技术学院,合肥,230039 |
| |
| 基金项目： | 安徽省自然科学研究项目基金 |
| |
| 摘 要： | 针对传统的层次聚类算法每次迭代只将距离最小的那对类簇合并，容易受离群点影响，偏向于发现凸状或球状簇等缺点，受CURE算法启发，采用簇中固定数量代表点来代表簇对象进行距离的计算，并结合90_10规则，提出了一种改进的层次聚类算法REPBFC（REpresentative Points Based Fast Clustering），实验表明该算法是有效的。
|
| 关 键 词： | 90_10规则 多阶段聚类 聚类算法 |
| 收稿时间： | 2010-5-24 |
| 修稿时间： | 2010-8-27
|
Fast clustering algorithm based on representative points |
| |
| JIA Rui-yu,GENG Jin-wei,NING Zai-zao,HE Cheng-gang.Fast clustering algorithm based on representative points[J].Computer Engineering and Applications,2010,46(33):121-123. |
| |
| Authors: | JIA Rui-yu GENG Jin-wei NING Zai-zao HE Cheng-gang |
| |
| Affiliation: | (School of Computer Science and Technology,Anhui University,Hefei 230039,China) |
| |
| Abstract: | To the drawback of traditional hierarchical clustering algorithm that only merges one pair of the most similar clusters each iteration, easily influenced by outliers and favoring clusters with spherical shapes, inspired by CURE algorithm and the 90 10 rule,an improved clustering algorithm named REPBFC（REpresentative Points Based Fast Clustering） is proposed. The experiments show that the improved algorithm is efficient. |
| |
| Keywords: | 90_10 rule multistage clustering clustering algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载全文 |
|
