Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications

The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper, we generalize this algorithm in two important directions. The generalized algorithm--called GDBSCAN--can cluster point...

Full description

Saved in:
Bibliographic Details
Published inData mining and knowledge discovery Vol. 2; no. 2; p. 169
Main Authors Sander, Jörg, Martin, Ester, Kriegel, Hans-Peter, Xu, Xiaowei
Format Journal Article
LanguageEnglish
Published New York Springer Nature B.V 01.06.1998
Subjects
Algorithms
Clustering
Data mining
Earth science
Efficiency
Knowledge discovery
Methods
Neighborhoods
Online AccessGet full text

Cover

More Information
Summary:The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper, we generalize this algorithm in two important directions. The generalized algorithm--called GDBSCAN--can cluster point objects as well as spatially extended objects according to both, their spatial and their nonspatial attributes. In addition, four applications using 2D points (astronomy), 3D points (biology), 5D points (earth science) and 2D polygons (geography) are presented, demonstrating the applicability of GDBSCAN to real-world problems.
ISSN:1384-5810
1573-756X
DOI:10.1023/A:1009745219419