首页 | 本学科首页   官方微博 | 高级检索  
     检索      

一种基于密度的引力聚类算法
引用本文:张天伍,李卫平.一种基于密度的引力聚类算法[J].河南科学,2008,26(11).
作者姓名:张天伍  李卫平
作者单位:1. 河南工程学院,计算机科学与工程系,河南,新郑,451191
2. 中原工学院,信息商务学院,计算科学系,郑州,450007
摘    要:针对传统基于距离的聚类算法所存在的缺点,将万有引力和牛顿第二运动定律思想引入到聚类过程中,提出了一种改进的基于密度的引力聚类算法GCABD.该算法可以自动决定目标数据集中的簇的个数,并且能发现任意形状的簇且可以过滤"噪声"数据.实验结果表明,所提出的GCABD算法的聚类效果和精度均比典型的K-means算法好,提高了聚类质量.

关 键 词:数据挖掘  聚类分析  聚类算法  引力

A Gravitational Clustering Algorithm Based on Density
Zhang Tianwu,Li Weiping.A Gravitational Clustering Algorithm Based on Density[J].Henan Science,2008,26(11).
Authors:Zhang Tianwu  Li Weiping
Institution:Zhang Tianwu1,Li Weiping2(1.Computer Science & Engineering Department,Henan Institute of Engineering,Xinzheng 451191,Henan China,2.Department of Computer Science,College of Information & Business,Zhongyuan University of Technology,Zhengzhou 450007,China)
Abstract:Directing against the drawbacks of traditional algorithm based on distancet,he paper introduces gravitation and Newton second law of motion into the process of clusteringa,nd proposes an improved algorithm GCABD(Gravitational Clustering Algorithm Based on Density.) This algorithm can decide automatically the number of clusters in the target data seta,nd find any clusters with arbitrary forms and filter the noisy data.The experimental results show that GCABD algorithm is superior than typical K-means algorit...
Keywords:data mining  clustering analysis  clustering algorithm  gravitation  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号