Transcription of A Density-Based Algorithm for Discovering Clusters in ...
{{id}} {{{paragraph}}}
A Density-Based Algorithm for Discovering Clustersin Large Spatial Databases with NoiseMartin Ester, Hans-Peter Kriegel, Jiirg Sander, Xiaowei XuInstitute for Computer Science, university of MunichOettingenstr. 67, D-80538 Miinchen, Germany{ester I kriegel I sander I xwxu } algorithms are attractive for the task of class iden-tification in spatial databases. However, the application tolarge spatial databases rises the following requirements forclustering algorithms: minimal requirements of domainknowledge to determine the input parameters, discovery ofclusters with arbitrary shape and good efficiency on large da-tabases. The well-known clustering algorithms offer no solu-tion to the combination of these requirements. In this paper,we present the new clustering Algorithm DBSCAN relying ona Density-Based notion of Clusters which is designed to dis-cover Clusters of arbitrary shape.
Institute for Computer Science, University of Munich Oettingenstr. 67, D-80538 Miinchen, Germany {ester I kriegel I sander I xwxu } @informatik.uni-muenchen.de Abstract Clustering algorithms are attractive for the task of class iden-tification in …
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}