聚类分析
计算机科学
星团(航天器)
数据挖掘
密度估算
人工智能
数学
统计
估计员
程序设计语言
作者
Yan Li,Lingyun Sun,Yongchuan Tang,Weitao You
标识
DOI:10.1109/ihmsc55436.2022.00042
摘要
Density peaks clustering (DPC) is a succinct and efficient algorithm to discover the structure of datasets, and it has been used in a number of domains. However, applying DPC to real-world tasks faces two main challenges: how to estimate the appropriate local density in datasets with different density distributions, and how to robustly forms clusters. Substantial researches make efforts to improve DPC from the aspects of these two challenges so as to result in promising clustering results. In this study, at first, we comprehensively review the different types of local density estimation methods and cluster assignment strategies in DPC-related works, then briefly introduce the application of DPC. At last, we discuss potential future research directions of the DPC algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI