6.4.2 Dynamic fuzzy tree hierarchy relationship learning algorithm

We represent this in the form of a dynamic fuzzy tree, as shown in Fig. 6.3.

Fig. 6.3: DF production represented by dynamic fuzzy tree.

For the root node $(\overset{\leftarrow}{A},\vec{A}),$ the other nodes are divided into five non-overlapping limited subsets:

$\begin{array}{l} T_{1} = {({\overset{\leftarrow}{B}}_{1}, {\vec{B}}_{1}), ({\overset{\leftarrow}{C}}_{1}, {\vec{C}}_{1}), ({\overset{\leftarrow}{C}}_{2}, {\vec{C}}_{2})}, \\ T_{2} = {({\overset{\leftarrow}{B}}_{2}, {\vec{B}}_{2}), ({\overset{\leftarrow}{C}}_{3}, {\vec{C}}_{3})}, \\ T_{3} = {({\overset{\leftarrow}{B}}_{3}, {\vec{B}}_{3}), ({\overset{\leftarrow}{C}}_{4}, {\vec{C}}_{4}), ({\overset{\leftarrow}{C}}_{5}, {\vec{C}}_{5}), ({\overset{\leftarrow}{C}}_{6}, {\vec{C}}_{6}), ({\overset{\leftarrow}{D}}_{1}, {\vec{D}}_{1}), ({\overset{\leftarrow}{D}}_{2}, {\vec{D}}_{2}), ({\overset{\leftarrow}{D}}_{3}, {\vec{D}}_{3})}, \\ T_{4} = {({\overset{\leftarrow}{B}}_{4}, {\vec{B}}_{4}), ({\overset{\leftarrow}{C}}_{7}, {\vec{C}}_{7}), ({\overset{\leftarrow}{C}}_{8} \end{array}$

Get Dynamic Fuzzy Machine Learning now with the O’Reilly learning platform.

O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.

Start your free trial

Dynamic Fuzzy Machine Learning by Fanzhang Li, Li Zhang, Zhao Zhang

Don’t leave empty-handed

It’s yours, free.

Check it out now on O’Reilly