Scribd
Upload
48 views1 page

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

The paper presents GDBSCAN, a generalization of the DBSCAN clustering algorithm that can cluster both point objects and spatially extended objects based on spatial and non-spatial attributes. GDBSCAN is applied to real world problems involving astronomy, biology, earth science, and geography data represented as 2D points, 3D points, 5D points, and 2D polygons respectively, demonstrating the algorithm's applicability to spatial databases.

Uploaded by

suser
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PS, PDF, TXT or read online on Scribd
48 views1 page

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

The paper presents GDBSCAN, a generalization of the DBSCAN clustering algorithm that can cluster both point objects and spatially extended objects based on spatial and non-spatial attributes. GDBSCAN is applied to real world problems involving astronomy, biology, earth science, and geography data represented as 2D points, 3D points, 5D points, and 2D polygons respectively, demonstrating the algorithm's applicability to spatial databases.

Uploaded by

suser
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PS, PDF, TXT or read online on Scribd
You are on page 1/ 1

Density-Based Clustering in Spatial Databases:

The Algorithm GDBSCAN and its Applications


Jrg Sander, Martin Ester, Hans-Peter Kriegel, Xiaowei Xu
Institute for Computer Science, University of Munich
Oettingenstr. 67, D-80538 Mnchen, Germany
{sander | ester | kriegel | xwxu}@informatik.uni-muenchen.de

Abstract. 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 non-spatial 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.

Keywords: Clustering Algorithms, Spatial Databases, Efficiency, Applications.

You might also like