Fig. (8).

Decision tree or classification tree, in these trees internal nodes tests features (in each internal node corresponding feature is compared with a value), each branch corresponds to features value and finally leaves assigns a class label (positive or negative for interacting and non-interacting respectively).