| 基于遗传算法和k-medoids算法的聚类新算法* |
| |
| 引用本文： | 郝占刚,王正欧.基于遗传算法和k-medoids算法的聚类新算法*[J].现代图书情报技术,2006,1(5):44-46. |
| |
| 作者姓名： | 郝占刚 王正欧 |
| |
| 作者单位： | 天津大学系统工程研究所,天津,300072 |
| |
| 摘 要： | 提出一种基于遗传算法和k-medoids算法的新的聚类算法。指出该算法除能提高聚类的精度和识别孤立点外，还能加速遗传算法的收敛速度，节约时间成本。
|
| 关 键 词： | 遗传算法 k-medoids算法 |
| 收稿时间： | 2006-01-24 |
| 修稿时间： | 2006-01-24 |
A New Clustering Algorithm Based on GA and K-medoids Algorithm |
| |
| Hao Zhangang,Wang Zhengou.A New Clustering Algorithm Based on GA and K-medoids Algorithm[J].New Technology of Library and Information Service,2006,1(5):44-46. |
| |
| Authors: | Hao Zhangang Wang Zhengou |
| |
| Institution: | Institute of Systems Engineering, Tianjin University, Tianjin 300072, China |
| |
| Abstract: | This paper presents a new clustering algorithm based on GA(Genetic Algorithm) and k-medoids algorithm.The new algorithm can not only improve the precision of clustering but also recognize isolated points.At the same time,the new algorithm may expedite the convergence of GA and save the time cost for integration with the k-medoids algorithm in GA. |
| |
| Keywords: | Clustering Genetic Algorithm K-medoids Algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《现代图书情报技术》浏览原始摘要信息 |
| 点击此处可从《现代图书情报技术》下载免费的PDF全文 |
