A novel clustering algorithm based on quantum games

From MaRDI portal
Publication:3645362

DOI10.1088/1751-8113/42/44/445303zbMATH Open1175.81040arXiv0812.0743OpenAlexW3102636664MaRDI QIDQ3645362FDOQ3645362


Authors: Qiang Li, Yan He, Jingping Jiang Edit this on Wikidata


Publication date: 18 November 2009

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: Enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum game with the problem of data clustering, and then develop a quantum-game-based clustering algorithm, in which data points in a dataset are considered as players who can make decisions and implement quantum strategies in quantum games. After each round of a quantum game, each player's expected payoff is calculated. Later, he uses a link-removing-and-rewiring (LRR) function to change his neighbors and adjust the strength of links connecting to them in order to maximize his payoff. Further, algorithms are discussed and analyzed in two cases of strategies, two payoff matrixes and two LRR functions. Consequently, the simulation results have demonstrated that data points in datasets are clustered reasonably and efficiently, and the clustering algorithms have fast rates of convergence. Moreover, the comparison with other algorithms also provides an indication of the effectiveness of the proposed approach.


Full work available at URL: https://arxiv.org/abs/0812.0743




Recommendations




Cited In (11)





This page was built for publication: A novel clustering algorithm based on quantum games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3645362)