首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于网格的障碍约束下空间聚类算法
引用本文:孙宇清,赵锐,姚青,史斌,刘佳.一种基于网格的障碍约束下空间聚类算法[J].山东工业大学学报,2006,36(3):86-90.
作者姓名:孙宇清  赵锐  姚青  史斌  刘佳
作者单位:山东大学计算机科学与技术学院,山东济南250100
摘    要:障碍约束下的空间聚类问题具有很强的实用价值,是近几年来空间数据挖掘研究领域的一个热点,研究和分析了现有的障碍约束空间聚类算法,针对其中存在的问题,提出了一种新的基于密度和网格的障碍约束下空间聚类算法,该算法在CLICQU算法的基础上,引入障碍网格的概念和障碍物的网格化表达,使其能够处理任意形状的障碍约束聚类,通过理论分析和实验验证,该算法具有较好的时间复杂度和聚类效果。

关 键 词:空间数据挖掘  聚类  障碍约束  网格
文章编号:1672-3961(2006)03-0086-05
收稿时间:2005-01-12
修稿时间:2005-01-12

A mesh-based clustering algorithm in the presence of obstacles
SUN Yu-qing, ZHAO Rui, YAO Qing, SHI Bin, LIU Jia.A mesh-based clustering algorithm in the presence of obstacles[J].Journal of Shandong University of Technology,2006,36(3):86-90.
Authors:SUN Yu-qing  ZHAO Rui  YAO Qing  SHI Bin  LIU Jia
Affiliation:School of Computer Science and Technology, Shandong University, Jinan 250100, China
Abstract:Clustering of spatial data in the presence of obstacles has a wide application, and is an important research issue recently. A novel mesh-based clustering algorithm in the presence of obstacles is presented. Which introduces the concept of obstacle-mesh into the algorithm of CLICQU. By decomposing obstacles into appropriate meshes, the algorithm can deal with random-shape obstacles. Compared with the existing similar algorithms on the aspects of theory analysis and experiment, this algorithm has a preferable time complexity and clustering results on the same data objects.
Keywords:spatial data mining  clustering  obstacle constraints  mesh
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号