蚂蚁算法建立度限制树在聚类中的应用

Degree-constrained tree basing on ant algorithm for clustering analysis

针对聚类算法解决大规模数据时间复杂度和空间复杂度都很大的问题,给出了应用蚂蚁算法建立度限制树,同时结合密度思想来解决这一问题的算法.经过数据的测试和验证,得到了较好的结果和一系列有意义的结论.

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.