Deriving a concise description of non-self patterns in an aritificial immune system

  • Authors:
  • Sławomir T. Wierzchoń

  • Affiliations:
  • Polish Academy of Sciences, Warsaw, Poland

  • Venue:
  • New learning paradigms in soft computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

From a computer science perspective the immune system is a complex, self organizing and highly distributed system that has no centralized control and uses learning and memory when solving particular tasks. The learning process does not require negative examples and the acquired knowledge is represented in explicit form. The main actors of the immune systems are lymphocytes equipped with a set of receptors recognizing intruders, or pathogens (i.e. viruses, bacteria, etc.). Because the receptors on a surface of a single lymphocyte are of identical structure, and they recognize only a narrow class of pathogens, we can treat them as a single receptor from an abstract point of view. In this paper we focus on a binary AIS in which all the information is represented by the bit string, and as the match rule we take the k-contiguous bits rule: two strings match if they have the same bits in at least k contiguous positions. With such a method of receptor activation we study the number of strings recognized by a single receptor is proposed, and next we investigate how this number decreases when the size of the repertoire increases. Second, we give a method enabling to determine the number of strings which cannot be detected by an "ideal" repertoire in the presence of a set of self strings (i.e. strings representing normal behavior of a system). These results are of importance when constructing an optimal receptors repertoire.