Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (2): 106-108.DOI: 10.3778/j.issn.1002-8331.2010.02.033

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

Index creating method based on improved clustering

ZHANG Ze-bao,ZHANG Jian-pei,YANG Jing   

  1. School of Computer Science and Technology,Harbin Engineering University,Harbin 150001,China
  • Received:2009-01-15 Revised:2009-03-27 Online:2010-01-11 Published:2010-01-11
  • Contact: ZHANG Ze-bao

改进聚类的索引建立方法研究

张泽宝,张健沛,杨 静   

  1. 哈尔滨工程大学 计算机科学与技术学院,哈尔滨 150001
  • 通讯作者: 张泽宝

Abstract: In the traditional clustering methods based on grid and density,the interval and the density valve needs to be input with unsmoothed cluster,wrong judgement of clustering boundary.A clustering approach is proposed,which can confirm the interval and the number of clustering,reasonable cluster the object and create the Hilbert R-tree using the result of clustering.Experiment results show that the method is better than traditional Hilbert R-tree index in building time and other aspects.

Key words: clustering analysis, tree-like index, grid partition, Hilbert R-tree index

摘要: 传统的基于网格与密度的聚类方法需要用户输入间隔距离和密度阀值参数,聚类的结果不平滑,不能很好地判断边界对象的网格归属。提出了一种自动根据对象的数量确定间隔的距离和聚类的数量的聚类方法,合理地将对象进行聚类划分,并将聚类的结果构建Hilbert R-tree索引,通过实验表明算法在建立时间和其他性能上均优于传统的Hilbert R-tree索引。

关键词: 聚类分析, 树型索引, 网格划分, Hilbert R-tree索引

CLC Number: