arrow
返回

Unsupervised varied density based clustering algorithm using spline

delete2017-07-01
delete12
PRE
AI
S
Soumaya Louhichi
M
Mariem Gzara *
H
Hanêne Ben‐Abdallah
DOI:10.1016/j.patrec.2016.10.014delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
Data mining
Density based clustering
Varied density clustering
Interpolation
Exponential spline
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
7.9K
被引数:
1.6W

机构

U
universite de sfax
学者数:
8.9K
论文数: 7.7K
被引数: 5
引用论文

引用论文

err分享
err收藏
没有更多内容