arrow
返回

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

delete2024-06-14
delete0
PRE
AI
Z
Zhe Wang
Z
Zhijie He
D
Ding Liu *
DOI:10.1007/s10489-024-05587-8delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\sigma $$\end{document} on the experimental results.
Keyword:
Quantum clustering
Graph clustering
Graph gradient descent

期刊

Applied Intelligence 封面图
Applied Intelligence
IF:
3.5
论文数:
7.6K
被引数:
1.7W

机构

T
Tiangong University
学者数:
1.2W
论文数: 7.7K
被引数: 1.1W
引用论文

引用论文

Draft Genome Sequence of Three Endophyte Strains of Pseudomonas fluorescens Isolated from Miscanthus giganteus
err2016-10-27
err0
errOAAI
errAntónio S. Moreira; Kieran J. Germaine; Andrew Lloyd; Richard D. Lally; Paul T. Galbally; David Ryan; David N. Dowling
err分享
err收藏
学者 查看更多内容