arrow
Return

A fast DBSCAN clustering algorithm by accelerating neighbor searching using Groups method

delete2016-10-01
delete219
PRE
AI
A
A. Rama Mohan Reddy
DOI:10.1016/j.patcog.2016.03.008delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Density based clustering methods are proposed for clustering spatial databases with noise. Density Based Spatial Clustering of Applications with Noise (DBSCAN) can discover clusters of arbitrary shape and also handles outliers effectively. DBSCAN obtains clusters by finding the number of points within the specified distance from a given point. It involves computing distances from given point to all other points in the dataset. The conventional index based methods construct a hierarchical structure over the dataset to speed-up the neighbor search operations. The hierarchical index-structures fail to scale for datasets of dimensionality above 20. In this paper, we propose a novel graph-based index structure method Groups that accelerates the neighbor search operations and also scalable for high dimensional datasets. Experimental results show that the proposed method improves the speed of DBSCAN by a factor of about 1.5-2.2 on benchmark datasets. The performance of DBSCAN degrades considerably with noise due to unnecessary distance computations introduced by noise points while the proposed method is robust to noise by pruning out noise points early and eliminating the unnecessary distance computations. The cluster results produced by our method are exactly similar to that of DBSCAN but executed at a much faster pace. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Unsupervised learning
Density based clustering
DBSCAN
Neighborhood graph
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Pattern Recognition cover
Pattern Recognition
IF:
7.6
Papers:
1.3W
Citations:
4.5W

Organization

S
sri venkateswara university
Scholars:
1.3K
Papers: 1.2K
Citations: 2
Cited Papers

Cited Papers

err
IF0
err
err0
PREAI
err
errShare
errSave
Bleaching, coral mortality and subsequent survivorship on a West Australian fringing reef
err2012-10-21
err0
PREAI
errM. Depczynski; J. P. Gilmour; T. Ridgway; H. Barnes; A. J. Heyward; T. H. Holmes; J. A. Y. Moore; B. T. Radford; D. P. Thomson; P. Tinkler; S. K. Wilson
errShare
errSave
Object Depth Profile and Reflectivity Restoration From Sparse Single-Photon Data Acquired in Underwater Environments
err2017-09-01
err0
errOAAI
errAbderrahim Halimi; Aurora Maccarone; Aongus McCarthy; Steve McLaughlin; Gerald S. Buller
errShare
errSave
errShare
errSave
Image clustering based on sparse patch alignment framework
err2014-11-01
err101
PREAI
errYu, Jun; Hong, Richang; Wang, Meng; You, Jane
errShare
errSave
errShare
errSave
Combining multiple clusterings using similarity graph
err2011-03-01
err75
PREAI
errMimaroglu, Selim; Erdil, Ertunc
errShare
errSave
researcher View more