Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group
Density peaks clustering (DPC) is an advanced clustering technique due to its multiple advantages of efficiently determining cluster centers, fewer arguments, no iterations, no border noise, etc. However, it does suffer from the following defects: (1) difficult to determine a suitable value of its c...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2020-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2020/8864239 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832567776784416768 |
|---|---|
| author | Lin Ding Weihong Xu Yuantao Chen |
| author_facet | Lin Ding Weihong Xu Yuantao Chen |
| author_sort | Lin Ding |
| collection | DOAJ |
| description | Density peaks clustering (DPC) is an advanced clustering technique due to its multiple advantages of efficiently determining cluster centers, fewer arguments, no iterations, no border noise, etc. However, it does suffer from the following defects: (1) difficult to determine a suitable value of its crucial cutoff distance parameter, (2) the local density metric is too simple to find out the proper center(s) of the sparse cluster(s), and (3) it is not robust that parts of prominent density peaks are remotely assigned. This paper proposes improved density peaks clustering based on natural neighbor expanded group (DPC-NNEG). The cores of the proposed algorithm contain two parts: (1) define natural neighbor expanded (NNE) and natural neighbor expanded group (NNEG) and (2) divide all NNEGs into a goal number of sets as the final clustering result, according to the closeness degree of NNEGs. At the same time, the paper provides the measurement of the closeness degree. We compared the state of the art with our proposal in public datasets, including several complex and real datasets. Experiments show the effectiveness and robustness of the proposed algorithm. |
| format | Article |
| id | doaj-art-1464b1c9d62c4541b4940477f4851cb4 |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2020-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-1464b1c9d62c4541b4940477f4851cb42025-02-03T01:00:28ZengWileyComplexity1076-27871099-05262020-01-01202010.1155/2020/88642398864239Improved Density Peaks Clustering Based on Natural Neighbor Expanded GroupLin Ding0Weihong Xu1Yuantao Chen2School of Computer and Communication Engineering and Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha, Hunan 410114, ChinaSchool of Computer and Communication Engineering and Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha, Hunan 410114, ChinaSchool of Computer and Communication Engineering and Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation, Changsha University of Science and Technology, Changsha, Hunan 410114, ChinaDensity peaks clustering (DPC) is an advanced clustering technique due to its multiple advantages of efficiently determining cluster centers, fewer arguments, no iterations, no border noise, etc. However, it does suffer from the following defects: (1) difficult to determine a suitable value of its crucial cutoff distance parameter, (2) the local density metric is too simple to find out the proper center(s) of the sparse cluster(s), and (3) it is not robust that parts of prominent density peaks are remotely assigned. This paper proposes improved density peaks clustering based on natural neighbor expanded group (DPC-NNEG). The cores of the proposed algorithm contain two parts: (1) define natural neighbor expanded (NNE) and natural neighbor expanded group (NNEG) and (2) divide all NNEGs into a goal number of sets as the final clustering result, according to the closeness degree of NNEGs. At the same time, the paper provides the measurement of the closeness degree. We compared the state of the art with our proposal in public datasets, including several complex and real datasets. Experiments show the effectiveness and robustness of the proposed algorithm.http://dx.doi.org/10.1155/2020/8864239 |
| spellingShingle | Lin Ding Weihong Xu Yuantao Chen Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group Complexity |
| title | Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group |
| title_full | Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group |
| title_fullStr | Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group |
| title_full_unstemmed | Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group |
| title_short | Improved Density Peaks Clustering Based on Natural Neighbor Expanded Group |
| title_sort | improved density peaks clustering based on natural neighbor expanded group |
| url | http://dx.doi.org/10.1155/2020/8864239 |
| work_keys_str_mv | AT linding improveddensitypeaksclusteringbasedonnaturalneighborexpandedgroup AT weihongxu improveddensitypeaksclusteringbasedonnaturalneighborexpandedgroup AT yuantaochen improveddensitypeaksclusteringbasedonnaturalneighborexpandedgroup |