Grid-Based Hierarchical Spatial Clustering Algorithm in Presence of Obstacle and Constraints

Yue Yang, Jianpei Zhang, Jing Yang
{"title":"Grid-Based Hierarchical Spatial Clustering Algorithm in Presence of Obstacle and Constraints","authors":"Yue Yang, Jianpei Zhang, Jing Yang","doi":"10.1109/ICICSE.2008.18","DOIUrl":null,"url":null,"abstract":"Clustering of spatial data in the presence of obstacles and constraints has the very strong practical value, and becomes to an important research issue. Most of the existing spatial clustering algorithm in presence of obstacles and constraints can't cluster with irregular obstacles and the veracity of clustering result is affected. The algorithm complexity is affected by complexity of computing obstacle-distance. Grid-based hierarchical spatial clustering algorithm which is abbreviated as GSHCOC is proposed. The advantage of grid-based clustering algorithm is inherited. The obstacle-grid is defined and the algorithm processes arbitrary shape obstacle and finds arbitrary shape clusters efficiently. Meanwhile, the hierarchical strategy is used to reduce the complexity of clustering in presence of obstacles and constraints and the operation efficiency of algorithm is improved. The results of experiment show that GSHCOC algorithm can process spatial clustering in presence of obstacles and constraints and has higher clustering quality and better performance.","PeriodicalId":333889,"journal":{"name":"2008 International Conference on Internet Computing in Science and Engineering","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Internet Computing in Science and Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICSE.2008.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Clustering of spatial data in the presence of obstacles and constraints has the very strong practical value, and becomes to an important research issue. Most of the existing spatial clustering algorithm in presence of obstacles and constraints can't cluster with irregular obstacles and the veracity of clustering result is affected. The algorithm complexity is affected by complexity of computing obstacle-distance. Grid-based hierarchical spatial clustering algorithm which is abbreviated as GSHCOC is proposed. The advantage of grid-based clustering algorithm is inherited. The obstacle-grid is defined and the algorithm processes arbitrary shape obstacle and finds arbitrary shape clusters efficiently. Meanwhile, the hierarchical strategy is used to reduce the complexity of clustering in presence of obstacles and constraints and the operation efficiency of algorithm is improved. The results of experiment show that GSHCOC algorithm can process spatial clustering in presence of obstacles and constraints and has higher clustering quality and better performance.
障碍物和约束下基于网格的分层空间聚类算法
存在障碍和约束的空间数据聚类具有很强的实用价值,成为一个重要的研究课题。现有的空间聚类算法在存在障碍物和约束的情况下,大多不能对不规则障碍物进行聚类,影响聚类结果的准确性。算法的复杂度受障碍物距离计算复杂度的影响。提出了一种基于网格的分层空间聚类算法,简称GSHCOC。继承了基于网格的聚类算法的优点。定义了障碍物网格,该算法能有效地处理任意形状的障碍物并找到任意形状的聚类。同时,采用分层策略降低了存在障碍和约束时聚类的复杂度,提高了算法的运行效率。实验结果表明,GSHCOC算法可以在存在障碍和约束的情况下处理空间聚类,具有更高的聚类质量和更好的聚类性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信