A k-Deviation Density Based Clustering Algorithm

Due to the adoption of global parameters, DBSCAN fails to identify clusters with different and varied densities. To solve the problem, this paper extends DBSCAN by exploiting a new density definition and proposes a novel algorithm called k-deviation density based DBSCAN (kDDBSCAN). Various datasets...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical problems in engineering Vol. 2018; no. 2018; pp. 1 - 16
Main Authors: Jun, Li, Dongyong, Yang, Jinyin, Chen, Jungan, Chen
Format: Journal Article
Language:English
Published: Cairo, Egypt Hindawi Publishing Corporation 01.01.2018
Hindawi
John Wiley & Sons, Inc
Subjects:
Algorithms
Artificial intelligence
Bioinformatics
Clustering
Clusters
Computer science
Datasets
Density
Deviation
Engineering
International conferences
Neighborhoods
Noise
Parameter identification
Probability distribution
Similarity measures
ISSN:1024-123X, 1563-5147
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Due to the adoption of global parameters, DBSCAN fails to identify clusters with different and varied densities. To solve the problem, this paper extends DBSCAN by exploiting a new density definition and proposes a novel algorithm called k-deviation density based DBSCAN (kDDBSCAN). Various datasets containing clusters with arbitrary shapes and different or varied densities are used to demonstrate the performance and investigate the feasibility and practicality of kDDBSCAN. The results show that kDDBSCAN performs better than DBSCAN.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1024-123X
1563-5147
DOI:10.1155/2018/3742048