A Markov chain model of the B-cell algorithm

E Clark; A Hone; J Timmis

A Markov chain model of the B-cell algorithm

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English
Title of host publication	ARTIFICIAL IMMUNE SYSTEMS, PROCEEDINGS
Editors	C Jacob, ML Pilat, PJ Bentley, J Timmis
Place of Publication	BERLIN
Publisher	Springer
Pages	318-330
Number of pages	13
ISBN (Print)	3-540-28175-4
Publication status	Published - 2005
Event	4th International Conference on Artificial Immune Systems - Banff Duration: 14 Aug 2005 → 17 Aug 2005

Conference

Conference	4th International Conference on Artificial Immune Systems
City	Banff
Period	14/08/05 → 17/08/05

Keywords

HYPERMUTATION
OPTIMIZATION

Cite this

@inproceedings{eb5ee725fb4d4955ac431f966a4c3a5f,

title = "A Markov chain model of the B-cell algorithm",

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.",

keywords = "HYPERMUTATION, OPTIMIZATION",

author = "E Clark and A Hone and J Timmis",

year = "2005",

language = "English",

isbn = "3-540-28175-4",

pages = "318--330",

editor = "C Jacob and ML Pilat and PJ Bentley and J Timmis",

booktitle = "ARTIFICIAL IMMUNE SYSTEMS, PROCEEDINGS",

publisher = "Springer",

address = "Germany",

note = "4th International Conference on Artificial Immune Systems ; Conference date: 14-08-2005 Through 17-08-2005",

}

TY - GEN

T1 - A Markov chain model of the B-cell algorithm

AU - Clark, E

AU - Hone, A

AU - Timmis, J

PY - 2005

Y1 - 2005

N2 - 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.

AB - 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.

KW - HYPERMUTATION

KW - OPTIMIZATION

M3 - Conference contribution

SN - 3-540-28175-4

SP - 318

EP - 330

BT - ARTIFICIAL IMMUNE SYSTEMS, PROCEEDINGS

A2 - Jacob, C

A2 - Pilat, ML

A2 - Bentley, PJ

A2 - Timmis, J

PB - Springer

CY - BERLIN

T2 - 4th International Conference on Artificial Immune Systems

Y2 - 14 August 2005 through 17 August 2005

ER -