Unsupervised varied density based clustering algorithm using spline

Soumaya Louhichi

doi:10.1016/j.patrec.2016.10.014

Return

Unsupervised varied density based clustering algorithm using spline

2017-07-01

PRE

Soumaya Louhichi

Mariem Gzara *

Hanêne Ben‐Abdallah

DOI：10.1016/j.patrec.2016.10.014

Original

Original request for help

Save

Abstract

En 中文

Building upon the promising performances of density-based clustering, we present a novel density-based clustering algorithm called MDCUT (MultiDensity ClUsTering). The presented algorithm has the merit of clustering data with varied density. It operates in two phases. First, it finds the appropriate number of density levels in a data set; to do so, it uses the exponential spline mathematical process on the k-nearest neighbors' distance. Secondly, it uses these levels as local density thresholds to determine clusters with varied densities and arbitrary shapes. We show experimentally that the MDCUT algorithm detects correctly the density levels in a data set and succeeds to discover arbitrarily shaped clusters in decreasing density order. We validate the clustering results in terms of clustering error, precision and recall rates on various data sets. MDCUT performs well in comparison to several other clustering algorithms among which the DBSCAN algorithm. (C) 2016 Elsevier B.V. All rights reserved.

Keywords:

Data mining

Density based clustering

Varied density clustering

Interpolation

Exponential spline

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.