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

A novel analytic framework of real-time multi-vessel collision risk assessment for maritime traffic surveillance

TL;DR: A framework for multi-vessel collision risk assessment for maritime traffic surveillance is proposed and a key technique to ensure the safety and security of maritime traffic and transportation is considered.
Proceedings ArticleDOI

Performance and resource modeling in highly-concurrent OLTP workloads

TL;DR: This paper introduces a framework, called DBSeer, that addresses the problem of resource prediction and performance analysis and prediction for highly concurrent OLTP workloads by employing statistical models that are capable of accurately measuring several performance metrics, including resource consumption on a per-transaction-type basis, resource bottlenecks, and throughput at different load levels.
Posted Content

Linkage Based Face Clustering via Graph Convolution Network

TL;DR: Zhang et al. as discussed by the authors formulated the face clustering task as a link prediction problem, where a link exists between two faces if they are of the same identity and constructed sub-graphs around each instance as input data, which depict the local context.
Journal ArticleDOI

Identification and application of Extract Class refactorings in object-oriented systems

TL;DR: Through a set of experiments, it is shown that the tool is able to identify and extract new classes that developers recognize as "coherent concepts" and improve the design quality of the underlying system.
Journal ArticleDOI

Transport mode detection based on mobile phone network data: A systematic review

TL;DR: An in-depth, systematic review of transport mode detection based on mobile phone network data shows that existing studies tend to identify easy-to-detect modes, or aggregate fine-grained modes into more general groups, as well as privacy and bias issues.
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.