.png){kind=icon}
返回
Enhancing Density Peak Clustering via Density Normalization
.png){kind=icon}
PRE
AI
DOI：10.1109/TII.2019.2929743.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Clustering is able to find out implicit data distribution and is especially useful in data driven machine learning. Density based clustering has an attractive property of detecting clusters of arbitrary structures. The density peak algorithm makes use of two assumptions to detect cluster centers and then groups the other data. This approach is simple to implement and shown to be promising in many experiments. However, we find its clustering results are dependent on density kernel types and kernel parameters, and density difference across clusters also influences the results significantly. In this paper, we make a detailed study of the density peak algorithm and attribute the problems to the local density criterion in detecting cluster centers. We then use density normalization to relieve the influence of the problems, and present a density kernel to further improve clustering results. We conduct experiments with different types of datasets to demonstrate the performance of our approach.
Keyword:
Clustering algorithms
Kernel
Informatics
Partitioning algorithms
Iris
Machine learning
Fault diagnosis
Clustering
data driven
density normalization
fault diagnosis
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.9
论文数:
8.6K
被引数:
6.0W
机构
引用论文
.png){kind=icon}
Agglomerative Clustering-Based Network Partitioning for Parallel Power System Restoration基于凝聚聚类的并行电力系统恢复网络划分
OAAI
OAAI分享收藏分享收藏分享收藏
查看更多内容