Random optimal clustering algorithm based on complex annealing method
复合形退火的随机聚类算法

In order to solve the problem that the traditional clustering algorithm is apt to fall into local optimal solution, this paper presented a novel algorithm. First it introduced the main principle of the complex method and used an improved one to K-mean optimal clustering, this paper educed a series of formulation and gave the realization process of the algorithm later. Compared to other algorithms, the results by exemplification show that this algorithm is not only correct and feasible, but highly effective and steady, and has a wide area of application.