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

Turning single-molecule localization microscopy into a quantitative bioanalytical tool.

TL;DR: The history of SMLM is reviewed and how recent progress in methods for spatial point analysis has enabled quantitative measurement of S MLM data, providing insights into biomolecule patterning, clustering and oligomerization in biological systems are provided.
Book ChapterDOI

Spatio-temporal clustering

TL;DR: This chapter focuses on one type of spatio-temporal clustering - trajectory clustering, provides an overview of the state-of-the-art approaches and methods, and presents several scenarios in different application domains such as movement, cellular networks and environmental studies.
Journal ArticleDOI

A Review of Super-Resolution Single-Molecule Localization Microscopy Cluster Analysis and Quantification Methods.

TL;DR: The state-of-the-art clustering methods adopted to analyze and quantify SMLM data are described and the capabilities and shortcomings of the surveyed methods are examined.
Proceedings ArticleDOI

Identifying task-based sessions in search engine query logs

TL;DR: The Task-based Session Discovery Problem is formally defined as the problem of best approximating the manually annotated tasks, and several variants of well known clustering algorithms, as well as a novel efficient heuristic algorithm, specifically tuned for solving the TSDP are proposed.
Proceedings ArticleDOI

Protecting your daily in-home activity information from a wireless snooping attack

TL;DR: A new privacy leak in residential wireless ubiquitous computing systems is presented, and guidelines for designing future systems to prevent this problem are proposed, and it is shown how these guidelines can be used in a hybrid fashion to prevent against the FATS attack with low implementation costs.
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.