SKATER-CON: Unsupervised Regionalization via Stochastic Tree Partitioning within a Consensus Framework Using Random Spanning Trees: Research Paper

Orhun Aydin, Mark V. Janikas, R. Assunção, Ting-Hwan Lee
{"title":"SKATER-CON: Unsupervised Regionalization via Stochastic Tree Partitioning within a Consensus Framework Using Random Spanning Trees: Research Paper","authors":"Orhun Aydin, Mark V. Janikas, R. Assunção, Ting-Hwan Lee","doi":"10.1145/3281548.3281554","DOIUrl":null,"url":null,"abstract":"Spatially constrained clustering, also known as regionalization, aims to group spatial objects into spatially contiguous clusters also known as regions. Among different approaches, tree-based partitioning is reported to define homogeneous regions rigorously, without ad-hoc adjustments, in a computationally efficient manner. One of the shortcomings of tree-based partitioning is the so-called chaining problem that results in sub-optimal regions. We propose a consensus-based regionalization approach to address the chaining problem associated with a single tree, in particular the minimum spanning tree, by exploring a wide range of partitions via a set of random spanning trees (RST). We propose an algorithm, namely SKATER-CON, that partitions spatial data via a consensus-based framework from an ensemble of regionalizations defined by its deterministic counter-part, the SKATER algorithm applied along stochastic search paths defined by RSTs. SKATER-CON utilizes evidence accumulation to represent an ensemble of regionalizations as a similarity graph. The similarity graph represents spatial objects as vertexes and frequency at which objects are assigned to the same region in the ensemble as edge weights. Proposed algorithm determines consensus among different regionalization by partitioning the similarity graph using a multi-level graph partitioning algorithm (METIS). Spatial constraints are imposed on the similarity graph prior to partitioning to ensure spatial constraints are reflected in the consensus result. We rigorously test the quality of regions produced by SKATER-CON on a large, synthetically generated dataset. The synthetic dataset is the result of full-factorial experiments designed on number, fuzziness, geometry and size of regions. Same dataset is also used compare our approach against state-of-the-art regionalization algorithms (SKATER and ARISEL). Lastly, we show the value added by SKATER-CON compared to SKATER on a real-world dataset based on Ecological Marine Units (EMU) dataset.","PeriodicalId":231184,"journal":{"name":"Proceedings of the 2nd ACM SIGSPATIAL International Workshop on AI for Geographic Knowledge Discovery","volume":"168 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2nd ACM SIGSPATIAL International Workshop on AI for Geographic Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3281548.3281554","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

Spatially constrained clustering, also known as regionalization, aims to group spatial objects into spatially contiguous clusters also known as regions. Among different approaches, tree-based partitioning is reported to define homogeneous regions rigorously, without ad-hoc adjustments, in a computationally efficient manner. One of the shortcomings of tree-based partitioning is the so-called chaining problem that results in sub-optimal regions. We propose a consensus-based regionalization approach to address the chaining problem associated with a single tree, in particular the minimum spanning tree, by exploring a wide range of partitions via a set of random spanning trees (RST). We propose an algorithm, namely SKATER-CON, that partitions spatial data via a consensus-based framework from an ensemble of regionalizations defined by its deterministic counter-part, the SKATER algorithm applied along stochastic search paths defined by RSTs. SKATER-CON utilizes evidence accumulation to represent an ensemble of regionalizations as a similarity graph. The similarity graph represents spatial objects as vertexes and frequency at which objects are assigned to the same region in the ensemble as edge weights. Proposed algorithm determines consensus among different regionalization by partitioning the similarity graph using a multi-level graph partitioning algorithm (METIS). Spatial constraints are imposed on the similarity graph prior to partitioning to ensure spatial constraints are reflected in the consensus result. We rigorously test the quality of regions produced by SKATER-CON on a large, synthetically generated dataset. The synthetic dataset is the result of full-factorial experiments designed on number, fuzziness, geometry and size of regions. Same dataset is also used compare our approach against state-of-the-art regionalization algorithms (SKATER and ARISEL). Lastly, we show the value added by SKATER-CON compared to SKATER on a real-world dataset based on Ecological Marine Units (EMU) dataset.
使用随机生成树的共识框架内通过随机树划分的无监督分区:研究论文
空间约束聚类,也称为区域化,旨在将空间对象分组为空间连续的集群,也称为区域。在不同的方法中,据报道,基于树的分区以计算效率高的方式严格定义同构区域,而无需特别调整。基于树的分区的缺点之一是所谓的链问题,它会导致次优区域。我们提出了一种基于共识的区域化方法,通过一组随机生成树(RST)探索大范围的分区,来解决与单个树(特别是最小生成树)相关的链问题。我们提出了一种算法,即SKATER- con,该算法通过基于共识的框架将空间数据从其确定性对应部分(SKATER算法)定义的区域集合中划分出来,该算法沿着rst定义的随机搜索路径应用。溜冰者- con利用证据积累来表示一个区域化的集合作为一个相似图。相似图将空间对象表示为顶点,将对象分配到集合中同一区域的频率表示为边缘权重。该算法采用多层次图划分算法(METIS)对相似图进行划分,从而确定不同区划之间的一致性。在划分之前对相似图施加空间约束,以确保空间约束在共识结果中得到反映。我们在一个大型的合成数据集上严格测试了由skate - con生成的区域的质量。合成数据集是对区域的数量、模糊性、几何形状和大小进行全因子实验设计的结果。还使用相同的数据集将我们的方法与最先进的区域化算法(SKATER和ARISEL)进行比较。最后,我们展示了基于生态海洋单位(EMU)数据集的真实数据集上,与SKATER相比,skate - con所增加的价值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信