一种快速的模拟退火算法及其在数据聚类中的应用

A Faster Simulated Annealing Algorithm for the Data Clustering and Its Application

文中把求解数据聚类问题转换为一个图形分割最优问题，提出一种快速的模拟退火算法。实验结果证明，快速模拟退火算法退火时间短，收敛速度快，把它应用于数据聚类中，可以获得较好的聚类结果。

： In this paper，we formulate for solving the data clustering problem as a graph partition optimal problem，and propose a faster simulated annealing algorithm．Both the analytical and experimental studies indicate that the faster simulated annealing algorithm can shorten annealing time and quicken convergence speed，and when the algorithm has been used in data clustering，excellent clustering results can be obtained．