The most computationally complex routine is the following, which
performs conjunction and disjunction. It follows both parent functions
from left to right. For each domain point, the values of both functions
are compared, with the smaller (conjunction) or larger (disjunction)
being output. Interpolation is used when necessary. If the functions
cross,
their intersection point is also output. This is illustrated in
Figure 17.17.
(XL.Y1L) (XR.YOR
(NEXT_X0,NEXT_Y0)
"
v"
kl
(XR,Y1R)
Fig.
17.17: Crawling along membership functions
This figure shows part of two fuzzy-set membership functions.
Computation
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month, and much more.