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
Proceedings ArticleDOI

On Density Based Transforms for Uncertain Data Mining

TL;DR: A new method for handling error-prone and missing data with the use of density based approaches to data mining, which can be effectively and efficiently applied to very large data sets, and turns out to be very useful as a general approach to such problems.
Journal ArticleDOI

Adaptive generation of challenging scenarios for testing and evaluation of autonomous vehicles

TL;DR: This method provides a test engineer with key insights into the software’s decision-making engine and how those decisions affect transitions between performance modes through adaptive, simulation-based testing of the autonomous system where each sample represents a simulated scenario.
Journal ArticleDOI

Modeling slip system strength evolution in Ti-7Al informed by in-situ grain stress measurements

TL;DR: In this article, a mesoscopic characterization of the aggregate response of slip system is derived from the average stress tensors of each grain over the applied deformation history, which are used to develop a slip system strength model as part of an elasto-viscoplastic constitutive model for the single crystal behavior.
Proceedings Article

Scalable, distributed data mining using an agent based architecture

TL;DR: PADMA as mentioned in this paper is a parallel agent-based system for data mining that makes an effort to address scalability and distributed nature of both data and computation in the context of data mining.
Proceedings ArticleDOI

Following Devil's Footprints: Cross-Platform Analysis of Potentially Harmful Libraries on Android and iOS

TL;DR: The research shows that most Android-side harmful behaviors have been preserved on their corresponding iOS libraries, and further identifies new evidence about libraries repackaging for harmful code propagations on both sides.
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.