Open AccessProceedings Article
A density-based algorithm for discovering clusters in large spatial Databases with Noise
Martin Ester,Hans-Peter Kriegel,Jörg Sander,Xiaowei Xu +3 more
- pp 226-231
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
Citations
More filters
Journal ArticleDOI
An overview of state-of-the-art partial discharge analysis techniques for condition monitoring
TL;DR: In this article, a focus of condition monitoring is to detect partial discharge (PD) especially in the early stages to prevent a serious power failure or outage, which is a key indicator of such electrical failure.
Journal ArticleDOI
An efficient and scalable algorithm for clustering XML documents by structure
TL;DR: This work proposes a hierarchical algorithm (S-GRACE) for clustering XML documents based on structural information in the data, and proposes a computationally efficient distance metric defined between documents and sets of documents using the notion of structure graph (s-graph).
Proceedings ArticleDOI
Robust identification of fuzzy duplicates
TL;DR: This work proposes two novel criteria that enable characterization of fuzzy duplicates more accurately than is possible with existing techniques, and proposes a novel framework for the fuzzy duplicate elimination problem.
Proceedings ArticleDOI
OP-cluster: clustering by tendency in high dimensional space
Jinze Liu,Wei Wang +1 more
TL;DR: A flexible yet powerful clustering model, namely OP-cluster (Order Preserving Cluster), which is essential in revealing significant gene regulatory networks and its effectiveness and efficiency in detecting coregulated patterns is demonstrated.
Journal ArticleDOI
Malware classification based on call graph clustering
Joris Kinable,Orestis Kostakis +1 more
TL;DR: In this paper, the authors proposed a call graph clustering approach to detect malware variants by abstracting certain variations away, enabling the detection of structural similarities between samples, which can be used to analyse the emergence of new malware families.
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
Raymond T. Ng,Jiawei Han +1 more
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.