MHC Regulation Based Immune Formula Discovering Algorithm (IFDA)

After having analyzed the advantage and disadvantage of gene expression programming (GEP), this paper proposes an innovative immune formula discovering algorithm (IFDA), which is actually inspired by MHC (major histocompatibility complex) regulation principle of immune theory. In IFDA, the formula are mapped as tree structure and transformed into both constant and variation section of antibody with a depth- first mechanism while its fragment is encoded into the MHC. Using the feature of MHC regulation, IFDA provides a quick solution to discover the proper formula. Many benchmark data are used for verifying the performance of IFDA in which all results from experiments show that the IFDA can really provide better performance than GEP.

[1]  Cullen Schaffer,et al.  A Proven Domain-Independent Scientific Function-Finding Algorithm , 1990, AAAI.

[2]  John R. Koza,et al.  Genetic Programming II , 1992 .

[3]  L.N. de Castro,et al.  An artificial immune network for multimodal function optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[4]  Rob J. De Boer,et al.  MHC polymorphism under host-pathogen coevolution , 2004, Immunogenetics.

[5]  Satoshi Endo,et al.  An immune optimization inspired by biological immune cell-cooperation for division-and-labor problem , 2001, Proceedings Fourth International Conference on Computational Intelligence and Multimedia Applications. ICCIMA 2001.

[6]  Koji Yamada,et al.  Immune algorithm for n-TSP , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).