计算机与现代化Issue(11)：90-93,97,5.DOI:10.3969/j.issn.1006-2475.2014.11.020
基于网格的多密度增量聚类算法
Multi-density Incremental Clustering Algorithm Based on Grid
李光兴 1尹冀川 2唐俊1
作者信息
- 1. 成都农业科技职业学院基础部，四川 成都 611130
- 2. 成都工业职业技术学院交通运输系，四川 成都 610081
- 折叠
摘要
Abstract
This paper presents a multi-density incremental clustering algorithm based on grid ( MICG) , the discriminant function taking into account relative density and gravity distance between grid cells is introduced. When a portion of the data sets changed, without re-clustering all the data, this algorithm could formulate a new cluster according to original clustering result merely based on the relationship between the unit with changed data set and neighbored unit. This approach effectively improved efficiency of cluster analysis. The time complexity and space complexity are linear with the size of dataset and the number of attributes. The experimental results show that MICG algorithm can process cluster with any shape or different densities, and can solve the incre-ment clustering problem effectively when the data is updated.关键词
网格聚类/增量聚类/多密度/单元/判别函数Key words
grid clustering/incremental clustering/multi-density/cell/discriminant function分类
信息技术与安全科学引用本文复制引用
李光兴,尹冀川,唐俊..基于网格的多密度增量聚类算法[J].计算机与现代化,2014,(11):90-93,97,5.
