| 蚂蚁算法建立度限制树在聚类中的应用 |
| |
| 引用本文： | 乔银锋,顾军华,张勇.蚂蚁算法建立度限制树在聚类中的应用[J].天津理工大学学报,2004,20(1):18-19. |
| |
| 作者姓名： | 乔银锋 顾军华 张勇 |
| |
| 作者单位： | 河北工业大学,计算机科学与软件学院,天津,300130 |
| |
| 基金项目： | 河北省自然科学基金资助项目(601055) |
| |
| 摘 要： | 针对聚类算法解决大规模数据时间复杂度和空间复杂度都很大的问题,给出了应用蚂蚁算法建立度限制树,同时结合密度思想来解决这一问题的算法.经过数据的测试和验证,得到了较好的结果和一系列有意义的结论.
|
| 关 键 词： | 聚类 度限制树 蚂蚁算法 |
| 文章编号： | 1004-2261(2004)01-0018-02 |
| 修稿时间： | 2003年9月1日 |
Degree-constrained tree basing on ant algorithm for clustering analysis |
| |
| QIAO Yin-feng,GU Jun-hua,ZHANG Yong.Degree-constrained tree basing on ant algorithm for clustering analysis[J].Journal of Tianjin University of Technology,2004,20(1):18-19. |
| |
| Authors: | QIAO Yin-feng GU Jun-hua ZHANG Yong |
| |
| Abstract: | This text solves extensive data time complexity and space complexity which is a heavy problem to cluster algorithm, and it uses ant algorithm to set up degree-constraint tree, combining density to solve the problem of this algorithm at the same time. Compared with verification, and other algorithms, it receives better results and a series of meaningful conclusions through the test of data. |
| |
| Keywords: | cluster the degree-constraint tree ant algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
