计算机工程与应用2019，Vol.55Issue(18)：61-66,102,7.DOI:10.3778/j.issn.1002-8331.1806-0356
利用区域划分的多密度快速聚类算法
Multi-Density Fast Clustering Algorithm Based on Region Partition
摘要
Abstract
For the problems that the grid based clustering algorithm exists noise points in cluster edge grid and can’t dis-tinguish grid with uniform density when grids are combined with relative density difference. Multi-density fast clustering algorithm based on region partition called MFCBR is proposed. The algorithm divides the data space into grids of differ-ent density and uses grid index table and grid center density difference to merge grids, then the center of mass of boundary grid, boundary grid and nearest cluster grid center are computed, the relationship between the three is used to exclude the noise points contained in cluster boundary grid data. Experiments show that the algorithm can reduce the clustering inter-ference of noise data, and has better effect on the uniform density of multi-density data set.关键词
区域划分/网格/质心/多密度/聚类Key words
region division/grid/centroid/multi-density/clustering分类
信息技术与安全科学引用本文复制引用
牛少章,欧毓毅,凌捷,顾国生..利用区域划分的多密度快速聚类算法[J].计算机工程与应用,2019,55(18):61-66,102,7.基金项目
广东省科技计划基金(No.2014B090901053,No.2014B090908010,No.2015B090906015,No.2015B090906016,No. 2017A050501035) （No.2014B090901053,No.2014B090908010,No.2015B090906015,No.2015B090906016,No. 2017A050501035）
广州市科技计划项目(No.201807010058). （No.201807010058）
