FU Tiao-ping, LIU Yu-shu. A Dynamic Alignment Hybrid Ant-Clustering AlgorithmJ. Transactions of Beijing institute of Technology, 2006, (6): 504-507.
Citation: FU Tiao-ping, LIU Yu-shu. A Dynamic Alignment Hybrid Ant-Clustering AlgorithmJ. Transactions of Beijing institute of Technology, 2006, (6): 504-507.

A Dynamic Alignment Hybrid Ant-Clustering Algorithm

  • A dynamic alignment hybrid ant-clustering and k-medoids(DAACM) algorithm is designed and realized.Based on aerial attack directions judgment problem,the deficiencies of traditional clustering algorithms are analyzed,DAACM algorithm for solving this problem is proposed.The novel ant-clustering algorithm can make full use of aerial target information,dynamically align parameters to gain the reasonable number of clusters and accelerate convergence.Also,when dealing with the isolated data,DAACM has good robustness.Some experiments have been made on real data sets and synthetic data sets.The results demonstrate that DAACM is an effective algorithm and can improve the precision and reasonableness in solving aerial attack directions judgment problem.
  • loading

Catalog

    Turn off MathJax
    Article Contents

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    Baidu
    map