| 一种基于快速分解模拟退火算法的数据聚类算法 |
| |
| 引用本文： | 张蓉,彭宏. 一种基于快速分解模拟退火算法的数据聚类算法[J]. 计算机工程, 2002, 28(8): 88-89 |
| |
| 作者姓名： | 张蓉 彭宏 |
| |
| 作者单位： | 1. 广东商学院信息学院,广州510320
2. 华南理工大学计算机系,广州510640 |
| |
| 基金项目： | 广东省科委基金项目---(2000J00601) |
| |
| 摘 要： | 把求解数据聚类问题转换为一个图形分割寻优问题,提出一种基于快速分解模拟退火算法的数据聚类算法。实验结果证明,快速分解模拟退火算法退火时间短,收敛速度快,磁盘开销小,把它应用于数据聚类中,可以获得较好的聚类结果。I/O
|
| 关 键 词： | 数据聚类 图形分割 模拟退火算法 |
| 文章编号： | 1000-3428(2002)08-0088-02 |
| 修稿时间： | 2002-04-29 |
A Faster Decoposition-based Simulated Annealing Algorithm for the Data Clustering and Its Application |
| |
| ZHANG Rong,PENG Hong. A Faster Decoposition-based Simulated Annealing Algorithm for the Data Clustering and Its Application[J]. Computer Engineering, 2002, 28(8): 88-89 |
| |
| Authors: | ZHANG Rong PENG Hong |
| |
| Affiliation: | ZHANG Rong1,PENG Hong2, |
| |
| Abstract: | 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. ;; |
| |
| Keywords: | Data clusteringGraph partitionSimulated annealing algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
