ADCN:基于各向异性密度的聚类算法

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems Pub Date : 2016-10-31 DOI:10.1145/2996913.2996940

Gengchen Mai, K. Janowicz, Yingjie Hu, Song Gao

{"title":"ADCN:基于各向异性密度的聚类算法","authors":"Gengchen Mai, K. Janowicz, Yingjie Hu, Song Gao","doi":"10.1145/2996913.2996940","DOIUrl":null,"url":null,"abstract":"In this work we introduce an anisotropic density-based clustering algorithm. It outperforms DBSCAN and OPTICS for the detection of anisotropic spatial point patterns and performs equally well in cases that do not explicitly benefit from an anisotropic perspective. ADCN has the same time complexity as DBSCAN and OPTICS, namely O(n log n) when using a spatial index, O(n2) otherwise.","PeriodicalId":20525,"journal":{"name":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2016-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"ADCN: an anisotropic density-based clustering algorithm\",\"authors\":\"Gengchen Mai, K. Janowicz, Yingjie Hu, Song Gao\",\"doi\":\"10.1145/2996913.2996940\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this work we introduce an anisotropic density-based clustering algorithm. It outperforms DBSCAN and OPTICS for the detection of anisotropic spatial point patterns and performs equally well in cases that do not explicitly benefit from an anisotropic perspective. ADCN has the same time complexity as DBSCAN and OPTICS, namely O(n log n) when using a spatial index, O(n2) otherwise.\",\"PeriodicalId\":20525,\"journal\":{\"name\":\"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2996913.2996940\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2996913.2996940","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

本文介绍了一种基于各向异性密度的聚类算法。它在检测各向异性空间点模式方面优于DBSCAN和OPTICS，并且在不明显受益于各向异性视角的情况下表现同样良好。ADCN具有与DBSCAN和OPTICS相同的时间复杂度，使用空间索引时为O(n log n)，不使用空间索引时为O(n2)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

ADCN: an anisotropic density-based clustering algorithm

In this work we introduce an anisotropic density-based clustering algorithm. It outperforms DBSCAN and OPTICS for the detection of anisotropic spatial point patterns and performs equally well in cases that do not explicitly benefit from an anisotropic perspective. ADCN has the same time complexity as DBSCAN and OPTICS, namely O(n log n) when using a spatial index, O(n2) otherwise.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems

自引率

0.00%

发文量