Computer Science ›› 2010, Vol. 37 ›› Issue (2): 225-228.
Previous Articles Next Articles
HUANG Liang-jun,SHUAI Dian-xun,ZHANG Bin
Online:
Published:
Abstract: A novel generalized quantum particle model (GQPM) was presented for data self-organizing clustering. In this model the data clustering process is transformed into a stochastic self-organizing process of the ctuantum particles in the state configuration space. I}he state configuration will evolve to a stationary probability distribution, and thus the optimal state configuration on particles can be obtained from the state configuration which has the highest probability in the stationary probability distribution. The convergence of the self-organizing process was proved in this paper. The GQPM algorithm has much faster clustering speed than the traditional clustering algorithm for the large scale database.Its superiorities were verified by the simulation experiments.
Key words: Data clustering, Multidimensional data, Stochastic process, Markov chain
HUANG Liang-jun,SHUAI Dian-xun,ZHANG Bin. Research on a Clustering Algorithm Based on Generalized Quantum Particle Model and its Convergence[J].Computer Science, 2010, 37(2): 225-228.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.jsjkx.com/EN/
https://www.jsjkx.com/EN/Y2010/V37/I2/225
Cited