Spatial clustering is a very important tool in the analysis of spatial data. In this paper, we propose a novel density based spatial clustering algorithm called K-DBSCAN with the main focus of identifying clusters of points with similar spatial density. This contrasts with many other approaches, whose main focus is spatial contiguity. The strength of K-DBSCAN lies in finding arbitrary shaped clusters in variable density regions. Moreover, it can also discover clusters with overlapping spatial regions, but differing density levels. The goal is to differentiate the most dense regions from lower density regions, with spatial contiguity as the secondary goal. The original DBSCAN fails to discover the clusters with variable density and overlapping regions. OPTICS and Shared Nearest Neighbour (SNN) algorithms have the capabilities of clustering variable density datasets but they have their own limitations. Both fail to detect overlapping clusters. Also, while handling varying density, both of the algorithms merge points from different density levels. K-DBSCAN has two phases: first, it divides all data objects into different density levels to identify the different natural densities present in the dataset, then it extracts the clusters using a modified version of DBSCAN. Experimental results on both synthetic data and a real-world spatial dataset demonstrate the effectiveness of our clustering algorithm.
{"title":"K-DBSCAN: Identifying Spatial Clusters with Differing Density Levels","authors":"Madhuri Debnath, P. Tripathi, R. Elmasri","doi":"10.1109/DMIA.2015.14","DOIUrl":"https://doi.org/10.1109/DMIA.2015.14","url":null,"abstract":"Spatial clustering is a very important tool in the analysis of spatial data. In this paper, we propose a novel density based spatial clustering algorithm called K-DBSCAN with the main focus of identifying clusters of points with similar spatial density. This contrasts with many other approaches, whose main focus is spatial contiguity. The strength of K-DBSCAN lies in finding arbitrary shaped clusters in variable density regions. Moreover, it can also discover clusters with overlapping spatial regions, but differing density levels. The goal is to differentiate the most dense regions from lower density regions, with spatial contiguity as the secondary goal. The original DBSCAN fails to discover the clusters with variable density and overlapping regions. OPTICS and Shared Nearest Neighbour (SNN) algorithms have the capabilities of clustering variable density datasets but they have their own limitations. Both fail to detect overlapping clusters. Also, while handling varying density, both of the algorithms merge points from different density levels. K-DBSCAN has two phases: first, it divides all data objects into different density levels to identify the different natural densities present in the dataset, then it extracts the clusters using a modified version of DBSCAN. Experimental results on both synthetic data and a real-world spatial dataset demonstrate the effectiveness of our clustering algorithm.","PeriodicalId":387758,"journal":{"name":"2015 International Workshop on Data Mining with Industrial Applications (DMIA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128393304","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Mariana Landoni, Andrei Rukavina, Maria L. Traverso, Paulina Verasay
The leaders of GAStech are celebrating their new found fortune as a result of the initial public offering of their very successful company, in the city of Abila, at the island country of Kronos. In the midst of this celebration, several employees of GAStech go missing. An organization known as the Protectors of Kronos is suspected in the disappearance. It is January 23, 2014, and the employees have been missing for three days. VAST 2014, Mini-Challenge 3 poses a streaming analysis challenge, with access to real-time feeds of microblogs and emergency calls, to identify what is happening in Abila and find the missing employees.
{"title":"VAST Challenge 2014: The Kronos Incident-Mini-Challenge 3","authors":"Mariana Landoni, Andrei Rukavina, Maria L. Traverso, Paulina Verasay","doi":"10.1109/DMIA.2015.16","DOIUrl":"https://doi.org/10.1109/DMIA.2015.16","url":null,"abstract":"The leaders of GAStech are celebrating their new found fortune as a result of the initial public offering of their very successful company, in the city of Abila, at the island country of Kronos. In the midst of this celebration, several employees of GAStech go missing. An organization known as the Protectors of Kronos is suspected in the disappearance. It is January 23, 2014, and the employees have been missing for three days. VAST 2014, Mini-Challenge 3 poses a streaming analysis challenge, with access to real-time feeds of microblogs and emergency calls, to identify what is happening in Abila and find the missing employees.","PeriodicalId":387758,"journal":{"name":"2015 International Workshop on Data Mining with Industrial Applications (DMIA)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125649021","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：