Faithful Density-Peaks Clustering via Matrix Computations on MPI Parallelization System
Density peaks clustering (DP) has the ability of detecting clusters of arbitrary shape and clustering non-Euclidean space data, but its quadratic complexity in both computing and storage makes it difficult to scale for big data. Various approaches have been proposed in this regard, including MapReduce based distribution computing, multi-core parallelism, presentation transformation (e.g., kd-tree, Z-value), granular computing, and so forth. However, most of these existing methods face two limitations. One is their target datasets are mostly constrained to be in Euclidian space, the other is they emphasize only on local neighbors while ignoring global data distribution due to restriction to cut-off kernel when computing density. To address the two issues, we present a faithful and parallel DP method that makes use of two types of vector-like distance matrices and an inverse leading-node-finding policy. The method is implemented on a message passing interface (MPI) system. Extensive experiments showed that our method is capable of clustering non-Euclidean data such as in community detection, while outperforming the state-of-the-art counterpart methods in accuracy when clustering large Euclidean data. Our code is publicly available at https://github.com/alanxuji/FaithPDP.
Code (1)
Tasks
ClusteringCommunity DetectionSimilar Papers 제목 키워드 기반
A density peaks clustering algorithm with sparse search and K-d tree
Density peaks clustering has become a nova of clustering algorithm because of its simplicity and practicality. However, there is one main drawback: it is time-consuming due to its high computational complexity. Herein, a…
2kClusteringFast density peaks clustering algorithm in polar coordinate system
Density peaks clustering (DPC) algorithm provides an efficient method to quickly find cluster centers with decision graphs. In recent years, due to its unique parameters, no iteration, and good robustness, it has been wi…
ClusteringAn Improved Density Peaks Method for Data Clustering
Clustering is a powerful approach for data analysis and its aim is to group objects based on their similarities. Density peaks clustering is a recently introduced clustering method with the advantages of doesn't need any…
ClusteringClustering Assisted Fundamental Matrix Estimation
In computer vision, the estimation of the fundamental matrix is a basic problem that has been extensively studied. The accuracy of the estimation imposes a significant influence on subsequent tasks such as the camera tra…
3D ReconstructionClusteringAutomatic topography of high-dimensional data sets by non-parametric Density Peak clustering
Data analysis in high-dimensional spaces aims at obtaining a synthetic description of a data set, revealing its main structure and its salient features. We here introduce an approach providing this description in the for…
Clustering