scispace - formally typeset
Open AccessProceedings Article

A density-based algorithm for discovering clusters in large spatial Databases with Noise

Reads0
Chats0
TLDR
DBSCAN, a new clustering algorithm relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape, is presented which requires only one input parameter and supports the user in determining an appropriate value for it.
Abstract
Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLARANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.

read more

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI

An automatic method to determine the number of clusters using decision-theoretic rough set

TL;DR: An efficient automatic method by extending the decision-theoretic rough set model to clustering, which is proved to stop automatically at the perfect number of clusters without manual interference, and a novel fast algorithm, FACA-DTRS, is devised based on the conclusion obtained in the validation of the ACA-D TRS algorithm.
Proceedings ArticleDOI

Learning syntactic program transformations from examples

TL;DR: Refazer as mentioned in this paper is a technique for automatically learning program transformations from examples of code edits performed by developers to fix incorrect programming assignment submissions, which can be used as input-output examples to learn program transformations.
Book ChapterDOI

Big Data Clustering: A Review

TL;DR: The trend and progress of clustering algorithms to cope with big data challenges from very first proposed algorithms until today's novel solutions are reviewed and the possible future path for more advanced algorithms is illuminated based on today’s available technologies and frameworks.
Journal ArticleDOI

The Rise of Radar for Autonomous Vehicles: Signal processing solutions and future research directions

TL;DR: Vehicular radars provide the key enabling technology for the autonomous driving revolution that will have a dramatic impact on everyone's day-to-day lives because of the significant progress in the radio-frequency CMOS technology that enables high-level radaron-chip integration and thus reduces the automotive radar cost to the level of consumer mass production.
References
More filters
Book

Finding Groups in Data: An Introduction to Cluster Analysis

TL;DR: An electrical signal transmission system, applicable to the transmission of signals from trackside hot box detector equipment for railroad locomotives and rolling stock, wherein a basic pulse train is transmitted whereof the pulses are of a selected first amplitude and represent a train axle count.
Proceedings ArticleDOI

The R*-tree: an efficient and robust access method for points and rectangles

TL;DR: The R*-tree is designed which incorporates a combined optimization of area, margin and overlap of each enclosing rectangle in the directory which clearly outperforms the existing R-tree variants.
Proceedings Article

Efficient and Effective Clustering Methods for Spatial Data Mining

TL;DR: The analysis and experiments show that with the assistance of CLAHANS, these two algorithms are very effective and can lead to discoveries that are difficult to find with current spatial data mining algorithms.
Journal ArticleDOI

An introduction to spatial database systems

TL;DR: This work surveys data modeling, querying, data structures and algorithms, and system architecture for spatial database systems, with the emphasis on describing known technology in a coherent manner, rather than listing open problems.