![]() |
|
|||
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
|
![]() |
[an error occurred while processing this directive]
One can also anticipate harmonic models governed by the trigonometric functions The generality of the mapping can be increased even further by utilizing neural networks in the condition part of the rule - if condition is A then y = NN(x, connections) (the right hand side of the rule is practically a highly nonlinear mapping furnished by the neural network). Instead of static dependences we can admit differential or difference equations in the conclusion part of the rule, say if condition is A then or if condition is A then x (k+1) =B x (k) +C u (k) (here k stands for a discrete time moment and u(k) is a sequence of control actions). 4.4.2. A design of fuzzy rule - based systemsAssuming that a collection of if-then statements is provided (we can relax this request afterwards by considering their learning mechanisms), arises a fundamental question of the design of the rule - based systems. The literature in this area is abundant; the reader can find plenty of useful hints and could be easily mislead by the meaningless technical variations that make some methods look new even though they are nothing but slight variations of some fundamental approaches. Our intent is to get a better grasp on the design of rule - based systems, underline main design problems and eventually study some algorithms. Let us emphasize first (that is nothing new and astonishing yet it puts the design in a proper perspective) that fuzzy sets are abstract mathematical concepts useful in capturing linguistic domain knowledge about a problem. Do fuzzy sets exist ? The same applies to probabilities -all of these are conceptual and helpful artifacts. This invokes two fundamentally distinct development framework within which fuzzy rule - based systems are to be constructed and tested:
Depending upon the type of the design and application framework, we exercise two relevant testing strategies, Fig. 4.4.
At the linguistic level the goal is to design a rule - based system such that it maps all rules
to the highest extent. This means that if A = Ak then the result of inference supported by the system should return B that is the same as Bk (or follows Bk as close as possible). In other words, we require that Bk = rule_based_system(Ak) for all the rules in the protocol, k=1, 2, ..., N. Note that the testing is fully fuzzy set oriented. The testing at the level of numeric quantities is somewhat more convoluted as the performance of the inference processing going on within the rule-based system is somewhat masked by the encoding and decoding procedures, Fig. 4.4 (these two schemes are usually referred to as a fuzzification and defuzzification). The best mapping criterion is applied against the numeric outputs of the rule-based system, meaning that if x =xk then the output y should follow yk as close as possible, k=1, 2, ..., N. Where (xk, yk) are the elements of the numeric testing set against which the system has to be verified. Here The implementation of the rule-based mapping is done in many possible ways. The main criterion uses a notion of transparency of the mapping. On one hand, there are pure logic-inclined constructs. As driven by logic features, these are highly transparent as far as interpretation aspects are concerned. They are far less flexible and may not well approximate (represent) all the rules in the system. The examples of this implementation track include fuzzy logic and fuzzy relational equations. On the other hand, we have neural network realizations that become quite dominant. By their nature, those are highly flexible yet difficult to interpret constructs. Obviously, the logical spirit of rule-based computing is not supported at all. There are also some realizations in-between. For instance, fuzzy Hebbian learning maintains a relatively high modularity of the implementation (that helps interpret the structure). It can be flexible once equipped with some extra parameters. Symbolically, these two features of transparency and flexibility allow us to locate any implementation in the flexibility -transparency plane, Fig. 4.5. When going for any new realization, it is worthwhile to identify its place in this plane to realize better its eventual advantages and disadvantages.
To gain a better insight into the algorithmic details of the implementation of rule-based systems, we discuss a Hebbian-like scheme of fuzzy associative memories.
Copyright © CRC Press LLC
![]() |
![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() |
![]() |