A Faster Decoposition-based Simulated Annealing Algorithm for the Data Clustering and Its Application
Hong Jian Peng · Jisuanji gongcheng · 2002
This paper formulates for solving the data clustering problem as a graph partition optimal problem , and proposes a method for clustering of data based on a faster decomposition-based simulated annealing algorithm . Both the analytical and experimental studies indicate that the faster decomposition-based simulated annealing algorithm can shorten annealing time ,quicken convergence speed and dramatically reduce the disk I/O activities , and when the algorithm has been used in data clustering , excellent clustering results can be obtained. ;;