Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship

The density peaks clustering (DPC) is a clustering method proposed by Rodriguez and Laio (Science, 2014), which sets up a decision graph to identify the cluster centers of data points. Because the improper selection of its parameter cut-off distance will lead to the wrong selection of initial cluste...

Full description

Bibliographic Details
Main Authors: Chunrong Wu, Jia Lee, Teijiro Isokawa, Jun Yao, Yunni Xia
Format: Article
Language:English
Published: IEEE 2019-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/8695694/
id doaj-2cfea637c5dc4e84b96d4d768b3e9157
record_format Article
spelling doaj-2cfea637c5dc4e84b96d4d768b3e91572021-03-29T22:48:27ZengIEEEIEEE Access2169-35362019-01-017606846069610.1109/ACCESS.2019.29123328695694Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood RelationshipChunrong Wu0https://orcid.org/0000-0002-2691-093XJia Lee1https://orcid.org/0000-0002-2304-4263Teijiro Isokawa2Jun Yao3Yunni Xia4https://orcid.org/0000-0001-9024-732XCollege of Computer Science, Chongqing University, Chongqing, ChinaCollege of Computer Science, Chongqing University, Chongqing, ChinaGraduate School of Engineering, University of Hyogo, Himeji, JapanCollege of Computer Science, Chongqing University, Chongqing, ChinaCollege of Computer Science, Chongqing University, Chongqing, ChinaThe density peaks clustering (DPC) is a clustering method proposed by Rodriguez and Laio (Science, 2014), which sets up a decision graph to identify the cluster centers of data points. Because the improper selection of its parameter cut-off distance will lead to the wrong selection of initial cluster centers with no corrective actions in the subsequent assignment process, DPC may not identify cluster centers with different densities accurately. Especially, all cluster centers are settled as soon as they are detected, after which the DPC simply assigns each point to the same cluster as its nearest neighbor of higher density. This tends to cause the erroneous assignments of data and thus degrade the efficiency of clustering. In this paper, we propose a robust clustering method which establishes a symmetric neighborhood graph over all data points, based on the k -nearest neighbors and reverse k-nearest neighbors of each point. In order to distinguish the density peaks from all data points, local densities of each point are calculated using the reverse k-nearest neighbors. After that, initial centers for clusters are estimated over the peaks and similar clusters are aggregated on the symmetric neighborhood graph, which ends up with every point being successfully assigned to a cluster. To testify the efficiency of the new clustering method, numerical experiments and comparison works have been done on a variety of artificial and real data sets for clustering.https://ieeexplore.ieee.org/document/8695694/Clusteringsymmetric neighborhoodreverse <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-nearest neighborsdensity peaks clustering
collection DOAJ
language English
format Article
sources DOAJ
author Chunrong Wu
Jia Lee
Teijiro Isokawa
Jun Yao
Yunni Xia
spellingShingle Chunrong Wu
Jia Lee
Teijiro Isokawa
Jun Yao
Yunni Xia
Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
IEEE Access
Clustering
symmetric neighborhood
reverse <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-nearest neighbors
density peaks clustering
author_facet Chunrong Wu
Jia Lee
Teijiro Isokawa
Jun Yao
Yunni Xia
author_sort Chunrong Wu
title Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
title_short Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
title_full Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
title_fullStr Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
title_full_unstemmed Efficient Clustering Method Based on Density Peaks With Symmetric Neighborhood Relationship
title_sort efficient clustering method based on density peaks with symmetric neighborhood relationship
publisher IEEE
series IEEE Access
issn 2169-3536
publishDate 2019-01-01
description The density peaks clustering (DPC) is a clustering method proposed by Rodriguez and Laio (Science, 2014), which sets up a decision graph to identify the cluster centers of data points. Because the improper selection of its parameter cut-off distance will lead to the wrong selection of initial cluster centers with no corrective actions in the subsequent assignment process, DPC may not identify cluster centers with different densities accurately. Especially, all cluster centers are settled as soon as they are detected, after which the DPC simply assigns each point to the same cluster as its nearest neighbor of higher density. This tends to cause the erroneous assignments of data and thus degrade the efficiency of clustering. In this paper, we propose a robust clustering method which establishes a symmetric neighborhood graph over all data points, based on the k -nearest neighbors and reverse k-nearest neighbors of each point. In order to distinguish the density peaks from all data points, local densities of each point are calculated using the reverse k-nearest neighbors. After that, initial centers for clusters are estimated over the peaks and similar clusters are aggregated on the symmetric neighborhood graph, which ends up with every point being successfully assigned to a cluster. To testify the efficiency of the new clustering method, numerical experiments and comparison works have been done on a variety of artificial and real data sets for clustering.
topic Clustering
symmetric neighborhood
reverse <italic xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">k</italic>-nearest neighbors
density peaks clustering
url https://ieeexplore.ieee.org/document/8695694/
work_keys_str_mv AT chunrongwu efficientclusteringmethodbasedondensitypeakswithsymmetricneighborhoodrelationship
AT jialee efficientclusteringmethodbasedondensitypeakswithsymmetricneighborhoodrelationship
AT teijiroisokawa efficientclusteringmethodbasedondensitypeakswithsymmetricneighborhoodrelationship
AT junyao efficientclusteringmethodbasedondensitypeakswithsymmetricneighborhoodrelationship
AT yunnixia efficientclusteringmethodbasedondensitypeakswithsymmetricneighborhoodrelationship
_version_ 1724190765192577024