Quantum clustering algorithm based on exponent measuring distance

Yao Zhang, Peng Wang, Gao Yun Chen, Dong Dong Chen, Rui Ding, Yan Zhang

Research output: Chapter in Book / Conference PaperConference Paperpeer-review

9 Citations (Scopus)

Abstract

The principle advantage and shortcoming of quantum clustering algorithm (QC) is analyzed. Based on its shortcomings, an improved algorithm --- exponent distance-based quantum clustering algorithm (EQDC) is produced. It improved the iterative procedure of QC algorithm and used exponent distanceformula to measure the distance between data points and the cluster centers. Experimental results demonstrate that the cluster accuracy of EDQC outperforms that of QC, and the exponent distance formula used in the clustering process performs better than the Euclidean distance in data preprocessing. What's more, the IRIS dataset can come to a satisfied result without preprocessing.

Original languageEnglish
Title of host publication2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop Proceedings, KAM 2008
Pages436-439
Number of pages4
DOIs
Publication statusPublished - 2008
Externally publishedYes
Event2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop, KAM 2008 - Wuhan, China
Duration: 21 Dec 200822 Dec 2008

Publication series

Name2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop Proceedings, KAM 2008

Conference

Conference2008 IEEE International Symposium on Knowledge Acquisition and Modeling Workshop, KAM 2008
Country/TerritoryChina
CityWuhan
Period21/12/0822/12/08

Keywords

  • Clustering accuracy
  • Data preprocessing
  • Exponent distance-based quantum clustering algorithm (EDQC algorithm)
  • Measuring formula
  • Quantum clustering algorithm
  • Quantum potential

Cite this