ConDPC: Data Connectivity-Based Density Peak Clustering

An improved density peaks clustering algorithm based on natural neighbor with a merging strategy

Density peaks clustering (DPC) is a well-known density-based clustering algorithm that can deal with nonspherical clusters well. However, DPC has high computational complexity and space complexity in calculating local density ρ and distance δ , which makes it suitable only for small-scale data sets. In addition, for clustering high-dimensional data, the performance of DPC still needs to be improved. High-dimensional data not only make the data distribution more complex but also lead to more computational overheads. To address the above issues, we propose an improved density peaks clustering algorithm, which combines feature reduction and data sampling strategy. Specifically, features of the high-dimensional data are automatically extracted by principal component analysis (PCA), auto-encoder (AE), and t-distributed stochastic neighbor embedding (t-SNE). Next, in order to reduce the computational overhead, we propose a novel data sampling method for the low-dimensional feature data. Firstly, the data distribution in the low-dimensional feature space is estimated by the Quasi-Monte Carlo (QMC) sequence with low-discrepancy characteristics. Then, the representative QMC points are selected according to their cell densities. Next, the selected QMC points are used to calculate ρ and δ instead of the original data points. In general, the number of the selected QMC points is much smaller than that of the initial data set. Finally, a two-stage classification strategy based on the QMC points clustering results is proposed to classify the original data set. Compared with current works, our proposed algorithm can reduce the computational complexity from O n 2 to O N n , where N denotes the number of selected QMC points and n is the size of original data set, typically N ≪ n . Experimental results demonstrate that the proposed algorithm can effectively reduce the computational overhead and improve the model performance.

The density peaks clustering (DPC) algorithm can identify clusters with various shapes and densities in the underlying dataset. However, the DPC algorithm cannot exactly find the true quantity of clustering centers when computing the local density, and it is difficult to handle non-convex datasets. Moreover, the DPC algorithm is difficult to identify boundary points and outliers without a reasonable allocation strategy when dealing with low-density points. To solve these limitations, a novel deviation density peaks clustering (DeDPC) algorithm is proposed. First, the local deviation of the spatial distance of datasets with different structures is utilised to replace the local density to generate a more reasonable clustering center decision graph. Second, a threshold is defined to further divide and process low-density points. Finally, outliers in low-density points can be accurately found to accurately cluster the dataset. To evaluate the performance of the DeDPC algorithm, experiments are conducted on synthetic and real-world datasets and the DeDPC is compared with other clustering methods. The DeDPC is also applied to medical image segmentation to further demonstrate its capability for medical image processing. The simulation results show that the DeDPC method has good validity and utility for both non-convex datasets and medical image segmentation.

Density Peak Clustering (DPC) is a widely used clustering method that automatically identifies cluster centers based on local density and distance metrics. However, DPC tends to converge to local optimal solutions when processing datasets with uneven density distributions. This paper proposes DPC-DIST, an improved algorithm that addresses this limitation through a geometric distribution coefficient δ . By incorporating spatial distribution characteristics into density calculations, DPC-DIST effectively prevents convergence to suboptimal solutions. Comprehensive experiments on six benchmark datasets (Wine, Iris, Seeds, Blobs, R15, R3) demonstrate that DPC-DIST consistently outperforms the original DPC, K-means++, and spectral clustering algorithms. Significant improvements were observed in high-dimensional data processing, with 9.3 % increase in Silhouette Coefficient and 47.7 % improvement in Calinski-Harabasz Score on the Wine dataset. The algorithm shows particular advantages in facility location optimization and logistics planning applications, demonstrating its practical value for real-world scenarios.

Density peaks clustering (DPC) is a density-based clustering algorithm with excellent clustering performance including accuracy, automatically detecting the number of clusters, and identifying center points. However, DPC has some shortcomings to be addressed before it can be widely applied. For example, sensitive predefined parameter is not suitable for manifold datasets, and decision graph easily causes the wrong center points. To address these issues, a new DPC algorithm based on weighted k-nearest neighbors and geodesic distance (DPC-WKNN-GD) is proposed in this article to improve the clustering performance for manifold and non-manifold datasets. The DPC-WKNN-GD introduces the weighted k-nearest neighbors based on Euclidean distance to optimize the local density <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\rho $ </tex-math></inline-formula> . Inspired by DPC-GD, the DPC-WKNN-GD redefines the distance <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\delta $ </tex-math></inline-formula> based on geodesic distance. The experimental results on artificial and real-world datasets, including image datasets, show that the DPC-WKNN-GD outperforms the state-of-the-art comparison algorithms on both manifold and non-manifold datasets. In addition, the DPC-WKNN-GD completely overcomes the DPC-GD defect, in which the decision graph displays misleading center points.

Modified FDP cluster algorithm and its application in protein conformation clustering analysis

Density peaks clustering based on superior nodes and fuzzy correlation

There is a large amount of information in the network data that we can exploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection problem. Meanwhile, there is always an unpredictable distribution of class clusters output by graph representation learning. Therefore, we propose an improved density peak clustering algorithm (ILDPC) for the community detection problem, which improves the local density mechanism in the original algorithm and can better accommodate class clusters of different shapes. And we study the community detection in network data. The algorithm is paired with the benchmark model Graph sample and aggregate (GraphSAGE) to show the adaptability of ILDPC for community detection. The plotted decision diagram shows that the ILDPC algorithm is more discriminative in selecting density peak points compared to the original algorithm. Finally, the performance of K-means and other clustering algorithms on this benchmark model is compared, and the algorithm is proved to be more suitable for community detection in sparse networks with the benchmark model on the evaluation criterion F1-score. The sensitivity of the parameters of the ILDPC algorithm to the low-dimensional vector set output by the benchmark model GraphSAGE is also analyzed.

Density peaks clustering algorithm is a simple but effective clustering method, which requires fewer parameters and iteration, and can determine the number of clusters. But this algorithm has high complexity of time and space which makes it is unsuitable to cluster large-scale data. So that this paper proposes a density peaks clustering algorithm based on the divide-and-conquer strategy. Firstly, divides the large-scale data into a series of data blocks consistent with the original data distribution, then performs density peaks clustering on a randomly selected block to get the clustering center of the data block. Since the data block has the same distribution with the original large-scale data, the clustering center can be used as the clustering center of the original data. Finally, allocates the remaining data blocks to the corresponding clustering center to obtain the final clustering result. Experimental results on real and synthetic datasets verify the effectiveness of the proposed algorithm.

Water flooding flowing area identification for oil reservoirs based on the method of streamline clustering artificial intelligence

English is a universal language and is widely used. In order to deepen the cognition of language, this paper proposes to analyse the variation of metadiscourse verb patterns in English academic papers from within and between disciplines. By comparing the metadiscourse chunks used in various disciplines, it is concluded that there are obvious differences in the verb types of the subject papers. Analysing various identification algorithms of verb types, it is obtained that the combination of the word movement distance (WMD) model and the R&amp;L density peak clustering algorithm is the best. Using the R&amp;L density peak clustering, identification parameters are easy to determine, and when combined with the WMD model to calculate the similarity of words, it improve the accuracy of verb pattern clustering. By comparison, it is proved that the accuracy of the algorithm combining the WMD model and R&amp;L density peak clustering reaches 30.06%, and the effect of identifying verb pattern variation is the best.

Dividing a network into communities has great benefits in understanding the characteristics of the network. The label propagation algorithm (LPA) is a fast and convenient community detection algorithm. However, the community initialization of LPA does not take advantage of topological information of networks, and its robustness is poor. In this paper, we propose a stable community detection algorithm based on density peak clustering and label propagation (DS-LPA). First, the local density calculation method in density peak clustering algorithm is improved in finding the community center of the network, so as to build a suitable initial community, which can improve the quality of community partition. Then, the label update order is determined reasonably by computing the information transmission power of nodes, and the solutions for multiple candidate labels are provided, which greatly improved the robustness of the algorithm. DS-LPA is compared with other seven algorithms on the synthetic network and real-world networks. NMI, ARI, and modularity are used to evaluate these algorithms. It can be concluded that DS-LPA has a higher performance than most comparison algorithms on synthetic network with ten different mixed parameters by statistical testing. And DS-LPA can quickly calculate the best community partition on different sizes of real-world networks.

Density Peaks Clustering (DPC) is a density-based clustering algorithm that has the advantage of not requiring clustering parameters and detecting non-spherical clusters. The density peaks algorithm obtains the actual cluster center by inputting the cutoff distance and manually selecting the cluster center. Thus, the clustering center point is not selected on the basis of considering the whole data set. This paper proposes a method called G-KNN-DPC to calculate the cutoff distance based on the Gini coefficient and K-nearest neighbor. G-KNN-DPC first finds the optimal cutoff distance with Gini coefficient, and then the center point with the K-nearest neighbor. The automatic clustering center method can not only avoid the error that a cluster detects two center points but also effectively solve the traditional DPC algorithm defect that cannot handle complex data sets. Compared with DPC, Fuzzy C-Means, K-means, KDPC and DBSCAN, the proposed algorithm creates better clusters on different data sets.

Outlier detection is an important field in data mining, which can be used in fraud detection, fault detection, and other fields. This article focuses on the problem where the density peak clustering algorithm needs a manual parameter setting and time complexity is high; the first is to use the k nearest neighbors clustering algorithm to replace the density peak of the density estimate, which adopts the KD-Tree index data structure calculation of data objects k close neighbors. Then it adopts the method of the product of density and distance automatic selection of clustering centers. In addition, the central relative distance and fast density peak clustering outliers were defined to characterize the degree of outliers of data objects. Then, based on fast density peak clustering outliers, an outlier detection algorithm was devised. Experiments on artificial and real data sets are performed to validate the algorithm, and the validity and time efficiency of the proposed algorithm are validated when compared to several conventional and innovative algorithms.

We adopt clustering algorithm to improve segmentation accuracy. In this paper, 3D laser scanning platform was built to obtain the spatial 3D point cloud data. And then we extracted the point cloud data for two planar features. K-means algorithm, density-based clustering algorithm and density peak clustering algorithm were employed to split the 3D point cloud of the two planes. After clustering, we compared and analyzed the clustering results of the three clustering algorithms. More importantly, we also found that for peak density clustering, the threshold value is related to its sensitivity to noise points. After fitting the two planes, the verticality of two planes was also calculated. We analyzed the results and summarized the criterion for selecting thresholds.