Computer and Modernization

Previous Articles     Next Articles

Multi-density Incremental Clustering Algorithm Based on Grid

  

  1. 1. Department of Fundamental Courses, Chengdu Vocational College of Agricultural Science and Technology, Chengdu 611130, China;
      2. Department of Transportation, Chengdu Industrial Vocational Technical College, Chengdu 610081, China
  • Received:2014-09-01 Online:2014-11-27 Published:2014-12-10

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 increment clustering problem effectively when the data is updated.

Key words:  , grid clustering, incremental clustering, multi-density, cell, discriminant function