An Improved DBSCAN Clustering Algorithm Based on Data Field

DBSCAN (density based spatial clustering of applications with noise) algorithm is a typical density-based clustering algorithm. The algorithm can discover the arbitrary-shaped clusters. However, the clustering results depend on the two parameters Eps and MinPts which are chosen by users. And for som...

Full description

Saved in:
Bibliographic Details
Published in:Jisuanji Kexue yu Tansuo / Journal of Computer Science and Frontiers Vol. 6; no. 10; pp. 903 - 911
Main Authors: Yang, Jing, Gao, Jiawei, Liang, Jiye, Liu, Yanglei
Format: Journal Article
Language:Chinese
Published: 01.10.2012
Subjects:
ISSN:1673-9418
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:DBSCAN (density based spatial clustering of applications with noise) algorithm is a typical density-based clustering algorithm. The algorithm can discover the arbitrary-shaped clusters. However, the clustering results depend on the two parameters Eps and MinPts which are chosen by users. And for some datasets with large density differences, either the clustering results may have the incorrect cluster number, or the algorithm may label part of the data as noise. Using the advantages that data field can commendably describe the data distribution and reflect the data relationship, this paper proposes a new clustering algorithm called improved DBSCAN algorithm based on data field. The algorithm introduces the concept of average potential difference and dynamically determines Eps and average potential difference of each class during the clustering process. In this way, it can receive better clustering results for some clusters with large density differences. Experimental results indicate that the proposed algorith
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ObjectType-Article-1
ObjectType-Feature-2
ISSN:1673-9418
DOI:10.3778/j.issn.1673-9418.2012.10.005