A Markov chain model of the b-cell algorithm

  • Authors:
  • Edward Clark;Andrew Hone;Jon Timmis

  • Affiliations:
  • Computing Laboratory, University of Kent, Canterbury, UK;Institute of Mathematics, Statistics & Actuarial Science, University of Kent;Departments of Electronics and Computer Science, University of York, Heslington, York

  • Venue:
  • ICARIS'05 Proceedings of the 4th international conference on Artificial Immune Systems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

An exact Markov chain model of the B-cell algorithm (BCA) is constructed via a novel possible transit method. The model is used to formulate a proof that the BCA is convergent absolute under a very broad set of conditions. Results from a simple numerical example are presented, we use this to demonstrate how the model can be applied to increase understanding of the performance of the BCA in optimizing function landscapes as well as giving insight into the optimal parameter settings for the BCA.