2005•Jisuanji gongcheng yu shejiRequires access

Partition-based DBSCAN algorithm with different parameter

Wang Xiu-qiong

Open publisher page 1 citations

Abstract

Clustering is one of the most important research fields in data mining.DBSCAN is a density based clustering algorithm.This algorithm is capable of clustering high density areas and finding arbitrary clusters in spatial database with noise.However,when DBSCAN is analyized,it is found that when data distribution is not even,clustering quality degrades for using the same global variable.In this paper,aimming at this weakness,a data partition based algorithm is proposed.For each local dataset,different variables are adopted,and clustering is done separately.At last local clustering results are merged.The experimental result demonstrates that the improved al-gorithm is effective and feasible.

About this research paper

What this paper is about

Clustering is one of the most important research fields in data mining.DBSCAN is a density based clustering algorithm.This algorithm is capable of clustering high density areas and finding arbitrary clusters in spatial database with noise.However,when DBSCAN is analyized,it is found that when data distribution is not even,clustering quality degrades for using the same global variable.In this paper,aimming at this weakness,a data partition based algorithm is proposed.For each local dataset,different variables are adopted,and clustering is done separately.At last local clustering results are merged.The experimental result demonstrates that the improved al-gorithm is effective and feasible.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Clustering is one of the most important research fields in data mining.DBSCAN is a density based clustering algorithm.This algorithm is capable of clustering high density areas and finding arbitrary clusters in spatial database with noise.However,when DBSCAN is analyized,it is found that when data distribution is not even,clustering quality degrades for using the same global variable.In this paper,aimming at this weakness,a data partition based algorithm is proposed.For each local dataset,different variables are adopted,and clustering is done separately.At last local clustering results are merged.The experimental result demonstrates that the improved al-gorithm is effective and feasible.

Key concepts: DBSCAN, Cluster analysis, Computer science, CURE data clustering algorithm, Partition (number theory), Data mining, Canopy clustering algorithm, Correlation clustering

Related papers

Back to paper searchBrowse research topicsOriginal source
Partition-based DBSCAN algorithm with different parameter — Research Paper | ScholarLens