Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

A new clustering algorithm based on distance and density

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Xiaopeng Yu ; Comput. Sch., Wuhan Univ., China ; Deyi Zhou ; Yan Zhou

Clustering is an important data exploration task. Several algorithms for clustering large data sets have been proposed in the literature using different methodologies, which can detect arbitrary shaped clusters where clusters are defined as dense regions separated by low-density regions. Traditional DBSCAN is an important density-based clustering algorithm. But it is difficult to set its two density thresholds (ε, MinPts) properly. And large volume of main memory must be available in order to guarantee DBSCAN to run smoothly. In this paper, a new DBSCAN based on k-nearest neighbors (KNN) is proposed, which merges KNN and DBSCAN to enhance DBSCAN. Firstly, the window-width of each data point is determined and the whole data set is partitioned into some fuzzy cluster (FC) by the KNN based on KDE. Next, the local parameters (ε, MinPts) of each FC are unsupervisedly determined according to the entropy theory. Finally, each local ε is mapped to the global ε, and each FC is separately clustered. The experimental results show that our clustering method achieves better performance on the quality of the resulting clustering and the results are not sensitive to the parameter k.

Published in:

Services Systems and Services Management, 2005. Proceedings of ICSSSM '05. 2005 International Conference on  (Volume:2 )

Date of Conference:

13-15 June 2005