A Markov Chain Model of the B-Cell Algorithm

  • Edward Clark
  • Andrew Hone
  • Jon Timmis
Conference paper

DOI: 10.1007/11536444_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3627)
Cite this paper as:
Clark E., Hone A., Timmis J. (2005) A Markov Chain Model of the B-Cell Algorithm. In: Jacob C., Pilat M.L., Bentley P.J., Timmis J.I. (eds) Artificial Immune Systems. ICARIS 2005. Lecture Notes in Computer Science, vol 3627. Springer, Berlin, Heidelberg


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Edward Clark
    • 1
  • Andrew Hone
    • 2
  • Jon Timmis
    • 3
  1. 1.Computing LaboratoryUniversity of KentCanterburyUK
  2. 2.Institute of Mathematics, Statistics & Actuarial ScienceUniversity of Kent 
  3. 3.Departments of Electronics and Computer ScienceUniversity of YorkHeslington, York

Personalised recommendations