Skip to main navigation Skip to search Skip to main content

An adaptive density-based clustering algorithm for spatial database with noise

  • SUNY Buffalo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

22 Scopus citations

Abstract

Clustering spatial data has various applications. Several clustering algorithms have been proposed to cluster objects in spatial databases. Spatial object distribution has significant effect on the results of clustering. Few of current algorithms consider the distribution of objects while processing clusters. In this paper, we propose an adaptive density-based clustering algorithm, ADBC, which uses a novel adaptive strategy for neighbor selection based on spatial object distribution to improve clustering accuracy. We perform a series of experiments on simulated data sets and real data sets. A comparison with DBSCAN and OPTICS shows the superiority of our new approach.

Original languageEnglish
Title of host publicationProceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004
EditorsR. Rastogi, K. Morik, M. Bramer, X. Wu
Pages467-470
Number of pages4
StatePublished - 2004
EventProceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004 - Brighton, United Kingdom
Duration: Nov 1 2004Nov 4 2004

Publication series

NameProceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Conference

ConferenceProceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004
Country/TerritoryUnited Kingdom
CityBrighton
Period11/1/0411/4/04

Fingerprint

Dive into the research topics of 'An adaptive density-based clustering algorithm for spatial database with noise'. Together they form a unique fingerprint.

Cite this