.png){kind=icon}
返回
An Effective Algorithm Based on Density Clustering Framework
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2017.2688477.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering analysis has the very broad applications on data analysis, such as data mining, machine learning, and information retrieval. In practice, most of clustering algorithms suffer from the effects of noises, different densities and shapes, cluster overlaps, etc. To solve the problems, in this paper, we propose a simple but effective density-based clustering framework (DCF) and implement a clustering algorithm based on DCF. In DCF, a raw data set is partitioned into core points and non-core points by a neighborhood density estimation model, and then the core points are clustered first, because they usually represent the center or dense region of the cluster structure. Finally, DCF classifies the non-core points into initial clusters in sequence. In experiments, we compare our algorithm with Dp and DBSCAN algorithms on synthetic and real-world data sets. The experimental results show that the performance of the proposed clustering algorithm is comparable with DBSCAN and Dp algorithms.
Keyword:
Clustering algorithms
reverse k-nearest neighbors
neighborhood density estimation
data mining
minimum spanning tree
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Genetic Polymorphism of 11 Allozyme Loci in Populations of Wall Lizards (Podarcis sp.) from the Iberian Peninsula and North Africa来自伊比利亚半岛和北非的壁蜥蜴 (Podarcis sp。) 种群中11个同工酶基因座的遗传多态性
PREAI
分享收藏
查看更多内容