Graph analysis using a GPU-based parallel algorithm: quantum clustering

The article introduces a new method for applying Quantum Clustering to graph structures. Quantum Clustering (QC) is a density-based unsupervised learning method that determines cluster centers by constructing a potential function. In this method, we develop the Graph Gradient Descent algorithm to find the centers of clusters for graph analysis. GPU parallelization is utilized for computing potential values. We also conducted comparative experiments on five widely used datasets and evaluated them using four indicators. The results show superior performance of our method. Finally, we discuss the influence of the crucial parameter \(\sigma \) $\sigma$ on the experimental results.