Information Technology Reference
In-Depth Information
of two messages, i.e., {11···1111···10}. The more general expression is as
follows:
s j {10#}
This is a subset defined by only one character. Suppose that
<
<
s 1 s 2 ··· s j ··· s l >.
m j {10},
is a l-bits message, which belongs to the following subset:
m 1 m 2 ··· m j ··· m l >,
(1) If
s j = 1 or
s j = 0then
m j
=
s j
(2) If
s j = #then
m j can be either 1 or 0.
FODVVLILHU
FRQGLWLRQ 0HVVDJHFRQWUDFW
LQSXWLQWHUIDFH
D
E
RXWSXWLQWHUIDFH
PHVVDJHWDEOH
PHVVDJHIRUPHQYLURQPHQW
PHVVDJHWRHQYLURQPHQW
DDOOPHVVDJHVIRUFRQGLWLRQWHVW
EWKHVHOHFWHGPHVVDJHVIURPFODVVLILHU
Fig. 13.4. Basic structure of classifier system
All messages meeting the above requirement constitute a subset, which is a
hyperplane in message space. A classifier system consists of a set of classifiers
{
C 1, C 2 , ···,C N }, a message table, input interface, output interface. Fig. 13.4
presents the basic structure of a classifier system. Each of its part's function is
illustrated as follows.
(1) The current environment state is transformed into standard message through
input interface.
Search WWH ::




Custom Search