Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (2): 197-201.

• 数据库与信息处理 • Previous Articles     Next Articles

Predicting clustering analysis algorithm for moving data

OUYANG Hao1,XIAO Jian-hua2   

  1. 1.Department of Computer Engineering,Guangxi University of Technology,Liuzhou,Guangxi 545006,China
    2.Department of Information Technology,Hunan First Normal College,Changsha 410002,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-11 Published:2008-01-11
  • Contact: OUYANG Hao

移动数据预估聚类分析算法

欧阳浩1,肖建华2   

  1. 1.广西工学院 计算机工程系,广西 柳州 545006
    2.湖南省第一师范学校 信息技术系,长沙 410002
  • 通讯作者: 欧阳浩

Abstract: The paper studies a predicting clustering analysis algorithm for moving data.Firstly,build a data model of moving data,then provide a clustering analysis algorithm for moving data based on mini-cluster,and detailedly analyze collision events and split events of moving mini-cluster.The new algorithm can predict arbitrary time clustering that is in the given period of time.

Key words: moving data, data mining, clustering, grid, micro-cluster

摘要: 研究了一种移动数据的预估聚类分析算法。首先建立移动数据的数学模型,然后在此模型的基础上,提出一个基于微簇的移动数据的聚类分析算法,并对移动微簇的相交和分裂事件进行了详细地分析。提出的新算法可以预测一定时间段内的任意时刻数据的聚类情况。

关键词: 移动数据, 数据挖掘, 聚类, 网格, 微簇