An Efficient Clustering Algorithm for 2D Multi-density Dataset in Large Database

Authors:
Ying Xia;GuoYin Wang;Song Gao
Affiliations:
Southwest Jiaotong University, Chengdu, 600031, P.R.China;Chongqing University of Posts and Telecommunications, Nan'an Distinct ChongQing, 400065, P.R.China;Chongqing University of Posts and Telecommunications, Nan'an Distinct ChongQing, 400065, P.R.China
Venue:
MUE '07 Proceedings of the 2007 International Conference on Multimedia and Ubiquitous Engineering
Year:
2007

Citing 0
Cited 1

Spatial Point-Data Reduction Using Pulse Coupled Neural Network

Neural Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Spatial clustering is an important component of spatial data mining. The requirement of detecting clusters of points arises in many applications. One of the challenges in spatial clustering is to find clusters on multi-density dataset. In this paper, a Grid-based Density-Confidence-Interval Clustering algorithm for 2-dimensional multi-density dataset is proposed, called GDCIC. The proposed algorithm combines the density confidence interval with grid-based clustering, and produces accurate density estimation in local areas for local density thresholds. Local dense areas are distinguished from sparse areas or outliers according to these thresholds. Experiments based on both synthetic and real datasets verify that the algorithm is efficiently for multi-data sets and handle outliers effectively.