A Markov chain model of the B-cell algorithm

Edward Clark*, Andrew Hone, Jon Timmis

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

36 Citations (SciVal)

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.

Original languageEnglish
Title of host publicationArtificial Immune Systems
Subtitle of host publication4th International Conference, ICARIS 2005, Banff, Alberta, Canada, August 14-17, 2005, Proceedings
PublisherSpringer Nature
Pages318-330
Number of pages13
Volume3627
DOIs
Publication statusPublished - 2005
Event4th International Conference on Artificial Immune Systems, ICARIS 2005 - Banff, Alta., Canada
Duration: 14 Aug 200517 Aug 2005

Publication series

NameLecture Notes in Computer Science
PublisherSpringer Nature
ISSN (Print)0302-9743

Conference

Conference4th International Conference on Artificial Immune Systems, ICARIS 2005
Country/TerritoryCanada
CityBanff, Alta.
Period14 Aug 200517 Aug 2005

Fingerprint

Dive into the research topics of 'A Markov chain model of the B-cell algorithm'. Together they form a unique fingerprint.

Cite this