Table of Content

Open Access iconOpen Access

ARTICLE

crossmark

Quantum Hierarchical Agglomerative Clustering Based on One Dimension Discrete Quantum Walk with Single-Point Phase Defects

Gongde Guo1, Kai Yu1, Hui Wang2, Song Lin1, *, Yongzhen Xu1, Xiaofeng Chen3

1 College of Mathematics and Informatics, Fujian Normal University, Fuzhou, 350007, China.
2 School of Computing and Mathematics, University of Ulster, Northern Ireland, BT37 0QB, UK.
3 School of Electronic Information Science, Fujian Jiangxia University, Fuzhou, 350108, China.

* Corresponding Author: Song Lin. Email: email.

Computers, Materials & Continua 2020, 65(2), 1397-1409. https://doi.org/10.32604/cmc.2020.011399

Abstract

As an important branch of machine learning, clustering analysis is widely used in some fields, e.g., image pattern recognition, social network analysis, information security, and so on. In this paper, we consider the designing of clustering algorithm in quantum scenario, and propose a quantum hierarchical agglomerative clustering algorithm, which is based on one dimension discrete quantum walk with single-point phase defects. In the proposed algorithm, two nonclassical characters of this kind of quantum walk, localization and ballistic effects, are exploited. At first, each data point is viewed as a particle and performed this kind of quantum walk with a parameter, which is determined by its neighbors. After that, the particles are measured in a calculation basis. In terms of the measurement result, every attribute value of the corresponding data point is modified appropriately. In this way, each data point interacts with its neighbors and moves toward a certain center point. At last, this process is repeated several times until similar data points cluster together and form distinct classes. Simulation experiments on the synthetic and real world data demonstrate the effectiveness of the presented algorithm. Compared with some classical algorithms, the proposed algorithm achieves better clustering results. Moreover, combining quantum cluster assignment method, the presented algorithm can speed up the calculating velocity.

Keywords


Cite This Article

G. Guo, K. Yu, H. Wang, S. Lin, Y. Xu et al., "Quantum hierarchical agglomerative clustering based on one dimension discrete quantum walk with single-point phase defects," Computers, Materials & Continua, vol. 65, no.2, pp. 1397–1409, 2020.



cc This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 2137

    View

  • 1173

    Download

  • 0

    Like

Share Link