Title | F-DPC: Fuzzy Neighborhood-Based Density Peak Algorithm |
Publication Type | Journal Article |
Year of Publication | 2020 |
Authors | Li, Y., Zhou, W., Wang, H. |
Journal | IEEE Access |
Volume | 8 |
Pagination | 165963–165972 |
ISSN | 2169-3536 |
Keywords | Classification algorithms, clustering, Clustering algorithms, compositionality, data mining, data objects, degree of membership, expandability, F-DPC, fuzzy neighborhood, fuzzy neighborhood density peak clustering, fuzzy neighborhood relationship, fuzzy neighborhood-based density peak algorithm, fuzzy set theory, Heuristic algorithms, Licenses, local density, neighborhood membership, Partitioning algorithms, pattern clustering, pubcrawl, Resiliency, Robustness, Shape |
Abstract | Clustering is a concept in data mining, which divides a data set into different classes or clusters according to a specific standard, making the similarity of data objects in the same cluster as large as possible. Clustering by fast search and find of density peaks (DPC) is a novel clustering algorithm based on density. It is simple and novel, only requiring fewer parameters to achieve better clustering effect, without the requirement for iterative solution. And it has expandability and can detect the clustering of any shape. However, DPC algorithm still has some defects, such as it employs the clear neighborhood relations to calculate local density, so it cannot identify the neighborhood membership of different values of points from the distance of points and It is impossible to accurately cluster the data of the multi-density peak. The fuzzy neighborhood density peak clustering algorithm is proposed for this shortcoming (F-DPC): novel local density is defined by the fuzzy neighborhood relationship. The fuzzy set theory can be used to make the fuzzy neighborhood function of local density more sensitive, so that the clustering for data set of various shapes and densities is more robust. Experiments show that the algorithm has high accuracy and robustness. |
DOI | 10.1109/ACCESS.2020.3022954 |
Citation Key | li_f-dpc_2020 |