Journal of South China University of Technology (Natural Science Edition) ›› 2009, Vol. 37 ›› Issue (4): 1-6.

• Computer Science & Technology •     Next Articles

aiNet Clustering Algorithm Based on Objective Evolution

Guo Jian-hua  Deng Fei-qi  Yang Hai-dong   

  1. School of Automation Science and Engineering, South China University of Technology, Guangzhou 510640, Guangdong, China
  • Received:2008-04-14 Revised:2008-05-28 Online:2009-04-25 Published:2009-04-25
  • Contact: 郭建华(1972-),男,博士生,主要从事信息安全、信息系统工程研究. E-mail:gjh209@163.com
  • About author:郭建华(1972-),男,博士生,主要从事信息安全、信息系统工程研究.
  • Supported by:

    广东省工业科技攻关计划项目(20078010200046);高等学校博士学科点专项科研基金资助项目(20070561081)

Abstract:

As the aiNet algorithm has no objective function and possesses a memory network with irregular and dynamic change, a new clustering algorithm of artificial immune network based on the objective evolution is proposed and is marked as OE-aiNet. In this algorithm, the compression and clustering based on artificial immune network is abstracted as a multi-objective planning problem, the objectives to which the memory network evolves is defined, and the quality of immunity learning is improved by adopting the vaccination strategy. Simulated results of kernel clustering and nonlinear clustering prove that  OE-aiNet is better than the existing aiNet algorithm in terms of clustering quality, compression quality and parameter sensitivity;  the average trace of class spread matrix of OE-aiNet, namely 4. 1420, is less than that of aiNet (4. 2575) ;  the compression ratio of OE-aiNet is 8.42% higher than that of aiNet; and  the clustering accuracy of OE-aiNet is not as sensitive to the compression threshold as that of aiNet

Key words: artificial immune network, objective evolution, clustering analysis, data compression