VoCC: Vortex Correlation Clustering Based on Masked Hough Transformation in Spatial Databases

Nelson Tavares de Sousa, Yannick Wölker, M. Renz, A. Biastoch
{"title":"VoCC: Vortex Correlation Clustering Based on Masked Hough Transformation in Spatial Databases","authors":"Nelson Tavares de Sousa, Yannick Wölker, M. Renz, A. Biastoch","doi":"10.1145/3609956.3609971","DOIUrl":null,"url":null,"abstract":"A special focus in data mining is to identify agglomerations of data points in spatial or spatio-temporal databases. Multiple applications have been presented to make use of such clustering algorithms. However, applications exist, where not only dense areas have to be identified, but also requirements regarding the correlation of the cluster to a specific shape must be met, i.e. circles. This is the case for eddy detection in marine science, where eddies are not only specified by their density, but also their circular-shaped rotation. Traditional clustering algorithms lack the ability to take such aspects into account. In this paper, we introduce Vortex Correlation Clustering which aims to identify those correlated groups of objects oriented along a vortex. This can be achieved by adapting the Circle Hough Transformation, already known from image analysis. The presented adaptations not only allow to cluster objects depending on their location next to each other, but also allows to take the orientation of individual objects into considerations. This allows for a more precise clustering of objects. A multi-step approach allows to analyze and aggregate cluster candidates, to also include final clusters, which do not perfectly satisfy the shape condition. We evaluate our approach upon a real world application, to cluster particle simulations composing such shapes. Our approach outperforms comparable methods of clustering for this application both in terms of effectiveness and efficiency.","PeriodicalId":274777,"journal":{"name":"Proceedings of the 18th International Symposium on Spatial and Temporal Data","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 18th International Symposium on Spatial and Temporal Data","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3609956.3609971","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A special focus in data mining is to identify agglomerations of data points in spatial or spatio-temporal databases. Multiple applications have been presented to make use of such clustering algorithms. However, applications exist, where not only dense areas have to be identified, but also requirements regarding the correlation of the cluster to a specific shape must be met, i.e. circles. This is the case for eddy detection in marine science, where eddies are not only specified by their density, but also their circular-shaped rotation. Traditional clustering algorithms lack the ability to take such aspects into account. In this paper, we introduce Vortex Correlation Clustering which aims to identify those correlated groups of objects oriented along a vortex. This can be achieved by adapting the Circle Hough Transformation, already known from image analysis. The presented adaptations not only allow to cluster objects depending on their location next to each other, but also allows to take the orientation of individual objects into considerations. This allows for a more precise clustering of objects. A multi-step approach allows to analyze and aggregate cluster candidates, to also include final clusters, which do not perfectly satisfy the shape condition. We evaluate our approach upon a real world application, to cluster particle simulations composing such shapes. Our approach outperforms comparable methods of clustering for this application both in terms of effectiveness and efficiency.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于掩蔽Hough变换的空间数据库涡旋相关聚类
数据挖掘的一个特别重点是识别空间或时空数据库中数据点的聚集。已经提出了使用这种聚类算法的多种应用。然而,在某些应用中,不仅需要识别密集区域,而且还必须满足关于集群与特定形状(即圆圈)的相关性的要求。这就是海洋科学中涡流检测的情况,其中涡流不仅由其密度指定,而且还由其圆形旋转指定。传统的聚类算法缺乏考虑这些方面的能力。本文引入了涡相关聚类,目的是识别沿涡方向方向的相关对象群。这可以通过调整从图像分析中已知的圆形霍夫变换来实现。所提出的适应性不仅允许根据彼此相邻的位置对对象进行聚类,而且还允许考虑单个对象的方向。这允许对对象进行更精确的聚类。多步骤方法允许分析和聚合候选聚类,也包括最终聚类,这些聚类不完全满足形状条件。我们在一个真实世界的应用中评估我们的方法,以群集粒子模拟组成这样的形状。我们的方法在有效性和效率方面都优于此应用程序的同类聚类方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
DEAR: Dynamic Electric Ambulance Redeployment Towards Workload Trend Time Series Probabilistic Prediction via Probabilistic Deep Learning Scalable Spatial Analytics and In Situ Query Processing in DaskDB Highway Systems: How Good are They, Really? Harmonization-guided deep residual network for imputing under clouds with multi-sensor satellite imagery
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1