DocumentCode
3097790
Title
Quantum Clustering Algorithm based on Exponent Measuring Distance
Author
Yao, Zhang ; Peng, Wang ; Gao-yun, Chen ; Dong-Dong, Chen ; Rui, Ding ; Yan, Zhang
Author_Institution
Comput. Dept., Chengdu Univ. of Inf. Technol., Chengdu
fYear
2008
fDate
21-22 Dec. 2008
Firstpage
436
Lastpage
439
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 distance formula 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.
Keywords
pattern clustering; quantum computing; Euclidean distance; IRIS dataset; data preprocessing; exponent measuring distance; iterative procedure; quantum clustering algorithm; Clustering algorithms; Concurrent computing; Data preprocessing; Hilbert space; Information technology; Iterative algorithms; Parallel processing; Quantum computing; Quantum mechanics; Schrodinger equation; clustering accuracy; data preprocessing; exponent distance-based quantum clustering algorithm (EDQC algorithm); measuring formula; quantum clustering algorithm; quantum potential;
fLanguage
English
Publisher
ieee
Conference_Titel
Knowledge Acquisition and Modeling Workshop, 2008. KAM Workshop 2008. IEEE International Symposium on
Conference_Location
Wuhan
Print_ISBN
978-1-4244-3530-2
Electronic_ISBN
978-1-4244-3531-9
Type
conf
DOI
10.1109/KAMW.2008.4810518
Filename
4810518
Link To Document