Graph Analysis Using a GPU-based Parallel Algorithm: Quantum Clustering

Abstract

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

References in corpus (5)

• Fast unfolding of communities in large networks
• Finding and evaluating community structure in networks
• Cooperative Game Theory Approaches for Network Partitioning
• Near linear time algorithm to detect community structures in large-scale networks
• Solving non-uniqueness in agglomerative hierarchical clustering using multidendrograms