.png){kind=icon}
返回
A sweep-line algorithm for spatial clustering
.png){kind=icon}
PRE
AI
DOI：10.1016/j.advengsoft.2008.06.003.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents an agglomerative hierarchical clustering algorithm for spatial data. It discovers clusters of arbitrary shapes which may be nested. The algorithm uses a sweeping approach consisting of three phases: sorting is done during the preprocessing phase, determination of clusters is performed during the sweeping phase, and clusters are adjusted during the post processing phase. The properties of the algorithm are demonstrated by examples. The algorithm is also adapted to the streaming algorithm for clustering large spatial datasets. (C) 2008 Elsevier Ltd. All rights reserved.
Keyword:
Algorithm
Spatial dataset
Sweep-line paradigm
Clustering
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.7
论文数:
3.4K
被引数:
1.2W
机构
引用论文
.png){kind=icon}
Ultrafiltration to characterize PM2.5 water-soluble iron and its sources in an urban environment
PREAI
分享收藏ACODF: a novel data clustering approach for data mining in large databasesACODF: 一种用于大型数据库数据挖掘的新型数据聚类方法
PREAI
分享收藏
查看更多内容